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/cav12/mem_slave_tlm.2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:33:15,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:33:15,252 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:33:15,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:33:15,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:33:15,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:33:15,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:33:15,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:33:15,273 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:33:15,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:33:15,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:33:15,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:33:15,276 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:33:15,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:33:15,280 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:33:15,281 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:33:15,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:33:15,283 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:33:15,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:33:15,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:33:15,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:33:15,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:33:15,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:33:15,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:33:15,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:33:15,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:33:15,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:33:15,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:33:15,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:33:15,310 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:33:15,310 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:33:15,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:33:15,311 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:33:15,311 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:33:15,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:33:15,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:33:15,313 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:33:15,326 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:33:15,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:33:15,327 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:33:15,327 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:33:15,328 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:33:15,328 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:33:15,329 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:33:15,329 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:33:15,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:33:15,329 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:33:15,329 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:33:15,330 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:33:15,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:33:15,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:33:15,330 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:33:15,330 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:33:15,331 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:33:15,331 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:33:15,331 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:33:15,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:33:15,331 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:33:15,333 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:33:15,333 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:33:15,395 INFO ]: Repository-Root is: /tmp [2018-06-26 20:33:15,412 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:33:15,419 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:33:15,421 INFO ]: Initializing SmtParser... [2018-06-26 20:33:15,421 INFO ]: SmtParser initialized [2018-06-26 20:33:15,421 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.2.smt2 [2018-06-26 20:33:15,423 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-26 20:33:15,501 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.2.smt2 unknown [2018-06-26 20:33:16,395 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.2.smt2 [2018-06-26 20:33:16,400 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:33:16,407 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:33:16,407 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:33:16,407 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:33:16,407 INFO ]: ChcToBoogie initialized [2018-06-26 20:33:16,410 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:33:16" (1/1) ... [2018-06-26 20:33:16,514 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:33:16 Unit [2018-06-26 20:33:16,514 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:33:16,515 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:33:16,515 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:33:16,515 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:33:16,536 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:33:16" (1/1) ... [2018-06-26 20:33:16,536 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:33:16" (1/1) ... [2018-06-26 20:33:16,555 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:33:16" (1/1) ... [2018-06-26 20:33:16,555 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:33:16" (1/1) ... [2018-06-26 20:33:16,577 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:33:16" (1/1) ... [2018-06-26 20:33:16,578 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:33:16" (1/1) ... [2018-06-26 20:33:16,585 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:33:16" (1/1) ... [2018-06-26 20:33:16,593 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:33:16,593 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:33:16,593 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:33:16,593 INFO ]: RCFGBuilder initialized [2018-06-26 20:33:16,594 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:33:16" (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-26 20:33:16,608 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:33:16,608 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:33:16,608 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:33:16,608 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:33:16,608 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:33:16,608 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-26 20:33:17,191 INFO ]: Using library mode [2018-06-26 20:33:17,194 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:33:17 BoogieIcfgContainer [2018-06-26 20:33:17,194 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:33:17,194 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:33:17,194 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:33:17,195 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:33:17,196 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:33:17" (1/1) ... [2018-06-26 20:33:17,216 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:33:17,218 INFO ]: Using Remove infeasible edges [2018-06-26 20:33:17,218 INFO ]: Using Maximize final states [2018-06-26 20:33:17,219 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:33:17,219 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:33:17,222 INFO ]: Using Remove sink states [2018-06-26 20:33:17,223 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:33:17,223 INFO ]: Using Use SBE [2018-06-26 20:33:17,263 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 20:33:17,701 INFO ]: SBE split 1 edges [2018-06-26 20:33:17,711 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:33:17,713 INFO ]: 0 new accepting states [2018-06-26 20:33:17,763 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:33:17,765 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:33:17,772 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:33:17,772 INFO ]: 0 new accepting states [2018-06-26 20:33:17,772 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:33:17,772 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:33:17,777 INFO ]: Encoded RCFG 6 locations, 99 edges [2018-06-26 20:33:17,777 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:33:17 BasicIcfg [2018-06-26 20:33:17,777 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:33:17,778 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:33:17,778 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:33:17,781 INFO ]: TraceAbstraction initialized [2018-06-26 20:33:17,782 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:33:16" (1/4) ... [2018-06-26 20:33:17,782 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac207eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:33:17, skipping insertion in model container [2018-06-26 20:33:17,782 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:33:16" (2/4) ... [2018-06-26 20:33:17,783 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac207eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:33:17, skipping insertion in model container [2018-06-26 20:33:17,783 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:33:17" (3/4) ... [2018-06-26 20:33:17,783 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac207eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:33:17, skipping insertion in model container [2018-06-26 20:33:17,783 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:33:17" (4/4) ... [2018-06-26 20:33:17,784 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:33:17,797 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:33:17,805 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:33:17,866 INFO ]: Using default assertion order modulation [2018-06-26 20:33:17,867 INFO ]: Interprodecural is true [2018-06-26 20:33:17,867 INFO ]: Hoare is false [2018-06-26 20:33:17,867 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:33:17,867 INFO ]: Backedges is TWOTRACK [2018-06-26 20:33:17,867 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:33:17,867 INFO ]: Difference is false [2018-06-26 20:33:17,867 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:33:17,867 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:33:17,877 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:33:17,887 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:33:17,887 INFO ]: Found error trace [2018-06-26 20:33:17,888 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:33:17,888 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:17,893 INFO ]: Analyzing trace with hash 38293250, now seen corresponding path program 1 times [2018-06-26 20:33:17,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:17,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:17,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:17,935 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:17,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:18,022 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:18,146 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:33:18,149 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:18,150 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:18,151 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:18,167 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:18,167 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:18,170 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:33:19,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:19,598 INFO ]: Finished difference Result 7 states and 142 transitions. [2018-06-26 20:33:19,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:19,600 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:33:19,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:19,608 INFO ]: With dead ends: 7 [2018-06-26 20:33:19,608 INFO ]: Without dead ends: 7 [2018-06-26 20:33:19,610 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-26 20:33:19,628 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:33:19,657 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:33:19,660 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:33:19,661 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2018-06-26 20:33:19,662 INFO ]: Start accepts. Automaton has 7 states and 142 transitions. Word has length 5 [2018-06-26 20:33:19,663 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:19,663 INFO ]: Abstraction has 7 states and 142 transitions. [2018-06-26 20:33:19,663 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:19,663 INFO ]: Start isEmpty. Operand 7 states and 142 transitions. [2018-06-26 20:33:19,663 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:33:19,663 INFO ]: Found error trace [2018-06-26 20:33:19,663 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:33:19,664 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:19,665 INFO ]: Analyzing trace with hash 1186051107, now seen corresponding path program 1 times [2018-06-26 20:33:19,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:19,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:19,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:19,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:19,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:19,728 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:19,819 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:33:19,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:19,820 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:19,821 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:19,821 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:19,821 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:19,821 INFO ]: Start difference. First operand 7 states and 142 transitions. Second operand 3 states. [2018-06-26 20:33:20,916 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:20,916 INFO ]: Finished difference Result 9 states and 199 transitions. [2018-06-26 20:33:20,917 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:20,917 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:33:20,917 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:20,918 INFO ]: With dead ends: 9 [2018-06-26 20:33:20,918 INFO ]: Without dead ends: 9 [2018-06-26 20:33:20,919 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-26 20:33:20,919 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:33:20,923 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:33:20,923 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:33:20,924 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2018-06-26 20:33:20,924 INFO ]: Start accepts. Automaton has 9 states and 199 transitions. Word has length 6 [2018-06-26 20:33:20,924 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:20,924 INFO ]: Abstraction has 9 states and 199 transitions. [2018-06-26 20:33:20,924 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:20,924 INFO ]: Start isEmpty. Operand 9 states and 199 transitions. [2018-06-26 20:33:20,925 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:33:20,925 INFO ]: Found error trace [2018-06-26 20:33:20,925 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:33:20,925 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:20,925 INFO ]: Analyzing trace with hash 1186170271, now seen corresponding path program 1 times [2018-06-26 20:33:20,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:20,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:20,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:20,926 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:20,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:20,956 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:21,022 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:33:21,022 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:21,022 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:21,022 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:21,022 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:21,022 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:21,023 INFO ]: Start difference. First operand 9 states and 199 transitions. Second operand 3 states. [2018-06-26 20:33:21,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:21,658 INFO ]: Finished difference Result 13 states and 304 transitions. [2018-06-26 20:33:21,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:21,658 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:33:21,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:21,659 INFO ]: With dead ends: 13 [2018-06-26 20:33:21,659 INFO ]: Without dead ends: 13 [2018-06-26 20:33:21,661 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-26 20:33:21,661 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:33:21,664 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:33:21,664 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:33:21,666 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 304 transitions. [2018-06-26 20:33:21,666 INFO ]: Start accepts. Automaton has 13 states and 304 transitions. Word has length 6 [2018-06-26 20:33:21,667 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:21,667 INFO ]: Abstraction has 13 states and 304 transitions. [2018-06-26 20:33:21,667 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:21,667 INFO ]: Start isEmpty. Operand 13 states and 304 transitions. [2018-06-26 20:33:21,667 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:33:21,667 INFO ]: Found error trace [2018-06-26 20:33:21,667 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:33:21,667 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:21,667 INFO ]: Analyzing trace with hash 1186378808, now seen corresponding path program 1 times [2018-06-26 20:33:21,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:21,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:21,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:21,668 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:21,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:21,700 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:21,787 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:33:21,787 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:21,787 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:21,788 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:21,788 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:21,788 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:21,788 INFO ]: Start difference. First operand 13 states and 304 transitions. Second operand 3 states. [2018-06-26 20:33:22,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:22,288 INFO ]: Finished difference Result 21 states and 397 transitions. [2018-06-26 20:33:22,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:22,288 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:33:22,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:22,289 INFO ]: With dead ends: 21 [2018-06-26 20:33:22,290 INFO ]: Without dead ends: 21 [2018-06-26 20:33:22,290 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-26 20:33:22,290 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 20:33:22,294 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 20:33:22,294 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 20:33:22,295 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 397 transitions. [2018-06-26 20:33:22,296 INFO ]: Start accepts. Automaton has 21 states and 397 transitions. Word has length 6 [2018-06-26 20:33:22,296 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:22,296 INFO ]: Abstraction has 21 states and 397 transitions. [2018-06-26 20:33:22,296 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:22,296 INFO ]: Start isEmpty. Operand 21 states and 397 transitions. [2018-06-26 20:33:22,296 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:33:22,296 INFO ]: Found error trace [2018-06-26 20:33:22,296 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:22,296 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:22,297 INFO ]: Analyzing trace with hash -1939759002, now seen corresponding path program 1 times [2018-06-26 20:33:22,297 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:22,297 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:22,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:22,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:22,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:22,331 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:22,383 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:33:22,383 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:22,383 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:22,383 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:22,383 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:22,383 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:22,383 INFO ]: Start difference. First operand 21 states and 397 transitions. Second operand 3 states. [2018-06-26 20:33:22,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:22,998 INFO ]: Finished difference Result 31 states and 567 transitions. [2018-06-26 20:33:22,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:22,998 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:33:22,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:23,000 INFO ]: With dead ends: 31 [2018-06-26 20:33:23,000 INFO ]: Without dead ends: 31 [2018-06-26 20:33:23,000 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-26 20:33:23,000 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:33:23,006 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:33:23,006 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:33:23,008 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 567 transitions. [2018-06-26 20:33:23,008 INFO ]: Start accepts. Automaton has 31 states and 567 transitions. Word has length 7 [2018-06-26 20:33:23,008 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:23,008 INFO ]: Abstraction has 31 states and 567 transitions. [2018-06-26 20:33:23,008 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:23,008 INFO ]: Start isEmpty. Operand 31 states and 567 transitions. [2018-06-26 20:33:23,009 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:33:23,009 INFO ]: Found error trace [2018-06-26 20:33:23,009 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:23,009 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:23,009 INFO ]: Analyzing trace with hash 1022124434, now seen corresponding path program 1 times [2018-06-26 20:33:23,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:23,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:23,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:23,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:23,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:23,038 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:23,129 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:33:23,130 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:23,130 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:23,130 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:23,130 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:23,130 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:23,130 INFO ]: Start difference. First operand 31 states and 567 transitions. Second operand 3 states. [2018-06-26 20:33:23,550 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:23,550 INFO ]: Finished difference Result 31 states and 447 transitions. [2018-06-26 20:33:23,550 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:23,551 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:33:23,551 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:23,551 INFO ]: With dead ends: 31 [2018-06-26 20:33:23,551 INFO ]: Without dead ends: 31 [2018-06-26 20:33:23,552 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-26 20:33:23,552 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:33:23,555 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:33:23,555 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:33:23,556 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 447 transitions. [2018-06-26 20:33:23,556 INFO ]: Start accepts. Automaton has 31 states and 447 transitions. Word has length 8 [2018-06-26 20:33:23,556 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:23,556 INFO ]: Abstraction has 31 states and 447 transitions. [2018-06-26 20:33:23,556 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:23,556 INFO ]: Start isEmpty. Operand 31 states and 447 transitions. [2018-06-26 20:33:23,557 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:33:23,557 INFO ]: Found error trace [2018-06-26 20:33:23,557 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:23,557 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:23,557 INFO ]: Analyzing trace with hash 2081403021, now seen corresponding path program 1 times [2018-06-26 20:33:23,557 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:23,557 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:23,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:23,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:23,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:23,582 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:23,657 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:33:23,658 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:23,658 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:23,658 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:23,658 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:23,658 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:23,658 INFO ]: Start difference. First operand 31 states and 447 transitions. Second operand 3 states. [2018-06-26 20:33:24,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:24,112 INFO ]: Finished difference Result 31 states and 318 transitions. [2018-06-26 20:33:24,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:24,113 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:33:24,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:24,114 INFO ]: With dead ends: 31 [2018-06-26 20:33:24,114 INFO ]: Without dead ends: 31 [2018-06-26 20:33:24,114 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-26 20:33:24,114 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:33:24,118 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:33:24,118 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:33:24,119 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 318 transitions. [2018-06-26 20:33:24,119 INFO ]: Start accepts. Automaton has 31 states and 318 transitions. Word has length 8 [2018-06-26 20:33:24,119 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:24,119 INFO ]: Abstraction has 31 states and 318 transitions. [2018-06-26 20:33:24,119 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:24,119 INFO ]: Start isEmpty. Operand 31 states and 318 transitions. [2018-06-26 20:33:24,120 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:33:24,120 INFO ]: Found error trace [2018-06-26 20:33:24,120 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:24,120 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:24,120 INFO ]: Analyzing trace with hash -792273616, now seen corresponding path program 1 times [2018-06-26 20:33:24,120 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:24,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:24,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:24,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:24,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:24,149 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:24,208 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:33:24,208 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:24,208 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:24,208 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:24,208 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:24,208 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:24,208 INFO ]: Start difference. First operand 31 states and 318 transitions. Second operand 3 states. [2018-06-26 20:33:24,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:24,633 INFO ]: Finished difference Result 31 states and 202 transitions. [2018-06-26 20:33:24,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:24,633 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:33:24,633 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:24,634 INFO ]: With dead ends: 31 [2018-06-26 20:33:24,634 INFO ]: Without dead ends: 31 [2018-06-26 20:33:24,634 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-26 20:33:24,634 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:33:24,637 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:33:24,637 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:33:24,638 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 202 transitions. [2018-06-26 20:33:24,638 INFO ]: Start accepts. Automaton has 31 states and 202 transitions. Word has length 9 [2018-06-26 20:33:24,638 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:24,638 INFO ]: Abstraction has 31 states and 202 transitions. [2018-06-26 20:33:24,638 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:24,638 INFO ]: Start isEmpty. Operand 31 states and 202 transitions. [2018-06-26 20:33:24,639 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:33:24,639 INFO ]: Found error trace [2018-06-26 20:33:24,639 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:24,639 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:24,639 INFO ]: Analyzing trace with hash 1412171011, now seen corresponding path program 1 times [2018-06-26 20:33:24,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:24,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:24,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:24,640 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:24,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:24,663 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:24,706 INFO ]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:33:24,706 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:24,706 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:24,706 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:24,707 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:24,707 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:24,707 INFO ]: Start difference. First operand 31 states and 202 transitions. Second operand 3 states. [2018-06-26 20:33:25,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:25,191 INFO ]: Finished difference Result 31 states and 142 transitions. [2018-06-26 20:33:25,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:25,191 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:33:25,192 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:25,192 INFO ]: With dead ends: 31 [2018-06-26 20:33:25,192 INFO ]: Without dead ends: 31 [2018-06-26 20:33:25,192 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-26 20:33:25,193 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:33:25,195 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:33:25,195 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:33:25,196 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 142 transitions. [2018-06-26 20:33:25,196 INFO ]: Start accepts. Automaton has 31 states and 142 transitions. Word has length 9 [2018-06-26 20:33:25,196 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:25,196 INFO ]: Abstraction has 31 states and 142 transitions. [2018-06-26 20:33:25,196 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:25,196 INFO ]: Start isEmpty. Operand 31 states and 142 transitions. [2018-06-26 20:33:25,196 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:33:25,196 INFO ]: Found error trace [2018-06-26 20:33:25,196 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:25,197 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:25,197 INFO ]: Analyzing trace with hash 216287775, now seen corresponding path program 1 times [2018-06-26 20:33:25,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:25,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:25,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:25,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:25,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:25,221 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:25,308 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:33:25,308 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:25,308 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:25,308 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:25,308 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:25,308 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:25,308 INFO ]: Start difference. First operand 31 states and 142 transitions. Second operand 3 states. [2018-06-26 20:33:26,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:26,531 INFO ]: Finished difference Result 31 states and 99 transitions. [2018-06-26 20:33:26,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:26,531 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:33:26,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:26,532 INFO ]: With dead ends: 31 [2018-06-26 20:33:26,532 INFO ]: Without dead ends: 31 [2018-06-26 20:33:26,532 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-26 20:33:26,532 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:33:26,535 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:33:26,535 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:33:26,536 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2018-06-26 20:33:26,536 INFO ]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 9 [2018-06-26 20:33:26,536 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:26,536 INFO ]: Abstraction has 31 states and 99 transitions. [2018-06-26 20:33:26,536 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:26,536 INFO ]: Start isEmpty. Operand 31 states and 99 transitions. [2018-06-26 20:33:26,536 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:33:26,536 INFO ]: Found error trace [2018-06-26 20:33:26,536 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:26,536 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:26,537 INFO ]: Analyzing trace with hash -571826767, now seen corresponding path program 1 times [2018-06-26 20:33:26,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:26,537 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:26,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:26,537 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:26,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:26,571 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:26,674 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:33:26,674 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:26,674 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:26,674 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:26,675 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:26,675 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:26,675 INFO ]: Start difference. First operand 31 states and 99 transitions. Second operand 3 states. [2018-06-26 20:33:27,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:27,589 INFO ]: Finished difference Result 50 states and 169 transitions. [2018-06-26 20:33:27,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:27,589 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:33:27,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:27,590 INFO ]: With dead ends: 50 [2018-06-26 20:33:27,590 INFO ]: Without dead ends: 49 [2018-06-26 20:33:27,590 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:27,590 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 20:33:27,593 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-26 20:33:27,594 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-26 20:33:27,594 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 168 transitions. [2018-06-26 20:33:27,595 INFO ]: Start accepts. Automaton has 49 states and 168 transitions. Word has length 10 [2018-06-26 20:33:27,595 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:27,595 INFO ]: Abstraction has 49 states and 168 transitions. [2018-06-26 20:33:27,595 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:27,595 INFO ]: Start isEmpty. Operand 49 states and 168 transitions. [2018-06-26 20:33:27,595 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:33:27,595 INFO ]: Found error trace [2018-06-26 20:33:27,595 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:27,596 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:27,596 INFO ]: Analyzing trace with hash -934589215, now seen corresponding path program 1 times [2018-06-26 20:33:27,596 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:27,596 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:27,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:27,596 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:27,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:27,631 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:27,744 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:33:27,745 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:27,745 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:27,745 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:27,745 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:27,745 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:27,745 INFO ]: Start difference. First operand 49 states and 168 transitions. Second operand 3 states. [2018-06-26 20:33:28,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:28,238 INFO ]: Finished difference Result 86 states and 266 transitions. [2018-06-26 20:33:28,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:28,239 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:33:28,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:28,240 INFO ]: With dead ends: 86 [2018-06-26 20:33:28,240 INFO ]: Without dead ends: 85 [2018-06-26 20:33:28,240 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:28,240 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-26 20:33:28,246 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-06-26 20:33:28,246 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-26 20:33:28,250 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 265 transitions. [2018-06-26 20:33:28,250 INFO ]: Start accepts. Automaton has 85 states and 265 transitions. Word has length 11 [2018-06-26 20:33:28,251 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:28,251 INFO ]: Abstraction has 85 states and 265 transitions. [2018-06-26 20:33:28,251 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:28,251 INFO ]: Start isEmpty. Operand 85 states and 265 transitions. [2018-06-26 20:33:28,251 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:33:28,251 INFO ]: Found error trace [2018-06-26 20:33:28,251 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:28,251 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:28,251 INFO ]: Analyzing trace with hash 1086967323, now seen corresponding path program 1 times [2018-06-26 20:33:28,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:28,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:28,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:28,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:28,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:28,291 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:28,404 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:33:28,404 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:28,404 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:28,404 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:28,404 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:28,404 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:28,405 INFO ]: Start difference. First operand 85 states and 265 transitions. Second operand 3 states. [2018-06-26 20:33:28,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:28,895 INFO ]: Finished difference Result 146 states and 434 transitions. [2018-06-26 20:33:28,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:28,898 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:33:28,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:28,900 INFO ]: With dead ends: 146 [2018-06-26 20:33:28,900 INFO ]: Without dead ends: 145 [2018-06-26 20:33:28,900 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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-26 20:33:28,900 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-26 20:33:28,916 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-06-26 20:33:28,916 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-26 20:33:28,918 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 433 transitions. [2018-06-26 20:33:28,918 INFO ]: Start accepts. Automaton has 145 states and 433 transitions. Word has length 12 [2018-06-26 20:33:28,918 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:28,918 INFO ]: Abstraction has 145 states and 433 transitions. [2018-06-26 20:33:28,918 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:28,918 INFO ]: Start isEmpty. Operand 145 states and 433 transitions. [2018-06-26 20:33:28,919 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:33:28,919 INFO ]: Found error trace [2018-06-26 20:33:28,919 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:28,919 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:28,919 INFO ]: Analyzing trace with hash 938088153, now seen corresponding path program 1 times [2018-06-26 20:33:28,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:28,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:28,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:28,920 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:28,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:28,962 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:29,073 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 20:33:29,073 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:29,073 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:29,073 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:29,073 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:29,073 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:29,073 INFO ]: Start difference. First operand 145 states and 433 transitions. Second operand 3 states. [2018-06-26 20:33:30,524 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:30,524 INFO ]: Finished difference Result 201 states and 597 transitions. [2018-06-26 20:33:30,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:30,527 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:33:30,527 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:30,529 INFO ]: With dead ends: 201 [2018-06-26 20:33:30,529 INFO ]: Without dead ends: 201 [2018-06-26 20:33:30,529 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:30,529 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-26 20:33:30,542 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-06-26 20:33:30,542 INFO ]: Start removeUnreachable. Operand 201 states. [2018-06-26 20:33:30,544 INFO ]: Finished removeUnreachable. Reduced from 201 states to 201 states and 597 transitions. [2018-06-26 20:33:30,544 INFO ]: Start accepts. Automaton has 201 states and 597 transitions. Word has length 13 [2018-06-26 20:33:30,544 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:30,544 INFO ]: Abstraction has 201 states and 597 transitions. [2018-06-26 20:33:30,544 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:30,545 INFO ]: Start isEmpty. Operand 201 states and 597 transitions. [2018-06-26 20:33:30,546 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:33:30,546 INFO ]: Found error trace [2018-06-26 20:33:30,546 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:30,546 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:30,546 INFO ]: Analyzing trace with hash 1602899951, now seen corresponding path program 1 times [2018-06-26 20:33:30,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:30,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:30,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:30,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:30,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:30,583 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:30,698 INFO ]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 20:33:30,699 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:30,699 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:30,699 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:30,699 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:30,699 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:30,699 INFO ]: Start difference. First operand 201 states and 597 transitions. Second operand 3 states. [2018-06-26 20:33:31,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:31,085 INFO ]: Finished difference Result 202 states and 594 transitions. [2018-06-26 20:33:31,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:31,086 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 20:33:31,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:31,087 INFO ]: With dead ends: 202 [2018-06-26 20:33:31,087 INFO ]: Without dead ends: 202 [2018-06-26 20:33:31,087 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-26 20:33:31,087 INFO ]: Start minimizeSevpa. Operand 202 states. [2018-06-26 20:33:31,095 INFO ]: Finished minimizeSevpa. Reduced states from 202 to 198. [2018-06-26 20:33:31,095 INFO ]: Start removeUnreachable. Operand 198 states. [2018-06-26 20:33:31,097 INFO ]: Finished removeUnreachable. Reduced from 198 states to 198 states and 578 transitions. [2018-06-26 20:33:31,097 INFO ]: Start accepts. Automaton has 198 states and 578 transitions. Word has length 14 [2018-06-26 20:33:31,098 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:31,098 INFO ]: Abstraction has 198 states and 578 transitions. [2018-06-26 20:33:31,098 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:31,098 INFO ]: Start isEmpty. Operand 198 states and 578 transitions. [2018-06-26 20:33:31,099 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:33:31,099 INFO ]: Found error trace [2018-06-26 20:33:31,099 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:31,099 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:31,099 INFO ]: Analyzing trace with hash 1121345614, now seen corresponding path program 1 times [2018-06-26 20:33:31,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:31,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:31,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:31,100 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:31,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:31,141 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:31,270 INFO ]: Checked inductivity of 78 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 20:33:31,270 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:31,270 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:31,271 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:31,271 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:31,271 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:31,271 INFO ]: Start difference. First operand 198 states and 578 transitions. Second operand 3 states. [2018-06-26 20:33:32,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:32,350 INFO ]: Finished difference Result 298 states and 766 transitions. [2018-06-26 20:33:32,351 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:32,351 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:33:32,351 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:32,353 INFO ]: With dead ends: 298 [2018-06-26 20:33:32,353 INFO ]: Without dead ends: 298 [2018-06-26 20:33:32,353 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 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-26 20:33:32,353 INFO ]: Start minimizeSevpa. Operand 298 states. [2018-06-26 20:33:32,362 INFO ]: Finished minimizeSevpa. Reduced states from 298 to 275. [2018-06-26 20:33:32,363 INFO ]: Start removeUnreachable. Operand 275 states. [2018-06-26 20:33:32,365 INFO ]: Finished removeUnreachable. Reduced from 275 states to 275 states and 724 transitions. [2018-06-26 20:33:32,365 INFO ]: Start accepts. Automaton has 275 states and 724 transitions. Word has length 17 [2018-06-26 20:33:32,366 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:32,366 INFO ]: Abstraction has 275 states and 724 transitions. [2018-06-26 20:33:32,366 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:32,366 INFO ]: Start isEmpty. Operand 275 states and 724 transitions. [2018-06-26 20:33:32,372 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:33:32,372 INFO ]: Found error trace [2018-06-26 20:33:32,372 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:32,372 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:32,372 INFO ]: Analyzing trace with hash -1670631906, now seen corresponding path program 1 times [2018-06-26 20:33:32,372 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:32,372 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:32,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:32,373 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:32,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:32,409 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:32,529 INFO ]: Checked inductivity of 78 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 20:33:32,530 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:32,530 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:32,530 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:32,530 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:32,530 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:32,530 INFO ]: Start difference. First operand 275 states and 724 transitions. Second operand 3 states. [2018-06-26 20:33:33,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:33,103 INFO ]: Finished difference Result 419 states and 1117 transitions. [2018-06-26 20:33:33,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:33,104 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:33:33,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:33,107 INFO ]: With dead ends: 419 [2018-06-26 20:33:33,107 INFO ]: Without dead ends: 419 [2018-06-26 20:33:33,107 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 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-26 20:33:33,107 INFO ]: Start minimizeSevpa. Operand 419 states. [2018-06-26 20:33:33,121 INFO ]: Finished minimizeSevpa. Reduced states from 419 to 418. [2018-06-26 20:33:33,121 INFO ]: Start removeUnreachable. Operand 418 states. [2018-06-26 20:33:33,123 INFO ]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1115 transitions. [2018-06-26 20:33:33,123 INFO ]: Start accepts. Automaton has 418 states and 1115 transitions. Word has length 17 [2018-06-26 20:33:33,123 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:33,123 INFO ]: Abstraction has 418 states and 1115 transitions. [2018-06-26 20:33:33,123 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:33,123 INFO ]: Start isEmpty. Operand 418 states and 1115 transitions. [2018-06-26 20:33:33,128 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:33:33,128 INFO ]: Found error trace [2018-06-26 20:33:33,128 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:33,128 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:33,129 INFO ]: Analyzing trace with hash 602100890, now seen corresponding path program 1 times [2018-06-26 20:33:33,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:33,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:33,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:33,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:33,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:33,173 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:33,397 INFO ]: Checked inductivity of 78 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 20:33:33,397 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:33:33,397 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-26 20:33:33,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:33,984 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:34,017 INFO ]: Computing forward predicates... [2018-06-26 20:33:34,256 INFO ]: Checked inductivity of 78 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 20:33:34,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:33:34,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:33:34,292 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:33:34,292 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:33:34,292 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:33:34,292 INFO ]: Start difference. First operand 418 states and 1115 transitions. Second operand 6 states. [2018-06-26 20:33:36,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:36,027 INFO ]: Finished difference Result 606 states and 1540 transitions. [2018-06-26 20:33:36,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 20:33:36,030 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-26 20:33:36,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:36,035 INFO ]: With dead ends: 606 [2018-06-26 20:33:36,035 INFO ]: Without dead ends: 606 [2018-06-26 20:33:36,035 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:33:36,035 INFO ]: Start minimizeSevpa. Operand 606 states. [2018-06-26 20:33:36,061 INFO ]: Finished minimizeSevpa. Reduced states from 606 to 583. [2018-06-26 20:33:36,061 INFO ]: Start removeUnreachable. Operand 583 states. [2018-06-26 20:33:36,065 INFO ]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1503 transitions. [2018-06-26 20:33:36,065 INFO ]: Start accepts. Automaton has 583 states and 1503 transitions. Word has length 17 [2018-06-26 20:33:36,065 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:36,065 INFO ]: Abstraction has 583 states and 1503 transitions. [2018-06-26 20:33:36,065 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:33:36,065 INFO ]: Start isEmpty. Operand 583 states and 1503 transitions. [2018-06-26 20:33:36,067 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:33:36,067 INFO ]: Found error trace [2018-06-26 20:33:36,067 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:36,067 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:36,067 INFO ]: Analyzing trace with hash 469388414, now seen corresponding path program 1 times [2018-06-26 20:33:36,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:36,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:36,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:36,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:36,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:36,126 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:36,431 INFO ]: Checked inductivity of 78 backedges. 46 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 20:33:36,431 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:33:36,431 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) [2018-06-26 20:33:36,444 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:33:36,965 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:36,987 INFO ]: Computing forward predicates... [2018-06-26 20:33:37,022 INFO ]: Checked inductivity of 78 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-26 20:33:37,045 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 20:33:37,045 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-26 20:33:37,046 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:33:37,046 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:33:37,046 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:33:37,046 INFO ]: Start difference. First operand 583 states and 1503 transitions. Second operand 6 states. [2018-06-26 20:33:38,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:38,658 INFO ]: Finished difference Result 1588 states and 3662 transitions. [2018-06-26 20:33:38,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 20:33:38,659 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-26 20:33:38,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:38,668 INFO ]: With dead ends: 1588 [2018-06-26 20:33:38,668 INFO ]: Without dead ends: 1531 [2018-06-26 20:33:38,668 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 20:33:38,669 INFO ]: Start minimizeSevpa. Operand 1531 states. [2018-06-26 20:33:38,709 INFO ]: Finished minimizeSevpa. Reduced states from 1531 to 1247. [2018-06-26 20:33:38,709 INFO ]: Start removeUnreachable. Operand 1247 states. [2018-06-26 20:33:38,716 INFO ]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2977 transitions. [2018-06-26 20:33:38,716 INFO ]: Start accepts. Automaton has 1247 states and 2977 transitions. Word has length 17 [2018-06-26 20:33:38,716 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:38,716 INFO ]: Abstraction has 1247 states and 2977 transitions. [2018-06-26 20:33:38,716 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:33:38,717 INFO ]: Start isEmpty. Operand 1247 states and 2977 transitions. [2018-06-26 20:33:38,722 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:33:38,722 INFO ]: Found error trace [2018-06-26 20:33:38,722 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:38,722 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:38,722 INFO ]: Analyzing trace with hash -1432210992, now seen corresponding path program 1 times [2018-06-26 20:33:38,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:38,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:38,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:38,723 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:38,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:38,767 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:38,857 INFO ]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-26 20:33:38,857 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:38,857 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:38,857 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:38,857 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:38,857 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:38,857 INFO ]: Start difference. First operand 1247 states and 2977 transitions. Second operand 3 states. [2018-06-26 20:33:39,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:39,534 INFO ]: Finished difference Result 1462 states and 3400 transitions. [2018-06-26 20:33:39,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:39,535 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:33:39,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:39,545 INFO ]: With dead ends: 1462 [2018-06-26 20:33:39,545 INFO ]: Without dead ends: 1386 [2018-06-26 20:33:39,545 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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-26 20:33:39,546 INFO ]: Start minimizeSevpa. Operand 1386 states. [2018-06-26 20:33:39,575 INFO ]: Finished minimizeSevpa. Reduced states from 1386 to 860. [2018-06-26 20:33:39,575 INFO ]: Start removeUnreachable. Operand 860 states. [2018-06-26 20:33:39,578 INFO ]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2191 transitions. [2018-06-26 20:33:39,578 INFO ]: Start accepts. Automaton has 860 states and 2191 transitions. Word has length 17 [2018-06-26 20:33:39,579 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:39,579 INFO ]: Abstraction has 860 states and 2191 transitions. [2018-06-26 20:33:39,579 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:39,579 INFO ]: Start isEmpty. Operand 860 states and 2191 transitions. [2018-06-26 20:33:39,581 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:33:39,581 INFO ]: Found error trace [2018-06-26 20:33:39,581 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:39,581 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:39,581 INFO ]: Analyzing trace with hash 316272440, now seen corresponding path program 1 times [2018-06-26 20:33:39,581 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:39,581 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:39,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:39,582 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:39,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:39,628 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:39,723 INFO ]: Checked inductivity of 91 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-26 20:33:39,723 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:39,724 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:39,724 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:39,724 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:39,724 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:39,724 INFO ]: Start difference. First operand 860 states and 2191 transitions. Second operand 3 states. [2018-06-26 20:33:41,097 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:41,097 INFO ]: Finished difference Result 1179 states and 2853 transitions. [2018-06-26 20:33:41,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:41,097 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:33:41,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:41,104 INFO ]: With dead ends: 1179 [2018-06-26 20:33:41,104 INFO ]: Without dead ends: 1164 [2018-06-26 20:33:41,104 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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-26 20:33:41,105 INFO ]: Start minimizeSevpa. Operand 1164 states. [2018-06-26 20:33:41,133 INFO ]: Finished minimizeSevpa. Reduced states from 1164 to 990. [2018-06-26 20:33:41,133 INFO ]: Start removeUnreachable. Operand 990 states. [2018-06-26 20:33:41,137 INFO ]: Finished removeUnreachable. Reduced from 990 states to 990 states and 2513 transitions. [2018-06-26 20:33:41,137 INFO ]: Start accepts. Automaton has 990 states and 2513 transitions. Word has length 18 [2018-06-26 20:33:41,137 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:41,137 INFO ]: Abstraction has 990 states and 2513 transitions. [2018-06-26 20:33:41,137 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:41,137 INFO ]: Start isEmpty. Operand 990 states and 2513 transitions. [2018-06-26 20:33:41,140 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:33:41,140 INFO ]: Found error trace [2018-06-26 20:33:41,140 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:41,140 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:41,141 INFO ]: Analyzing trace with hash 2141553613, now seen corresponding path program 1 times [2018-06-26 20:33:41,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:41,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:41,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:41,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:41,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:41,186 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:41,274 INFO ]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 20:33:41,274 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:41,274 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:41,274 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:41,274 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:41,274 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:41,274 INFO ]: Start difference. First operand 990 states and 2513 transitions. Second operand 3 states. [2018-06-26 20:33:41,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:41,750 INFO ]: Finished difference Result 997 states and 2422 transitions. [2018-06-26 20:33:41,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:41,752 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:33:41,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:41,755 INFO ]: With dead ends: 997 [2018-06-26 20:33:41,755 INFO ]: Without dead ends: 922 [2018-06-26 20:33:41,756 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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-26 20:33:41,756 INFO ]: Start minimizeSevpa. Operand 922 states. [2018-06-26 20:33:41,778 INFO ]: Finished minimizeSevpa. Reduced states from 922 to 707. [2018-06-26 20:33:41,778 INFO ]: Start removeUnreachable. Operand 707 states. [2018-06-26 20:33:41,781 INFO ]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1717 transitions. [2018-06-26 20:33:41,781 INFO ]: Start accepts. Automaton has 707 states and 1717 transitions. Word has length 18 [2018-06-26 20:33:41,781 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:41,781 INFO ]: Abstraction has 707 states and 1717 transitions. [2018-06-26 20:33:41,781 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:41,781 INFO ]: Start isEmpty. Operand 707 states and 1717 transitions. [2018-06-26 20:33:41,783 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 20:33:41,783 INFO ]: Found error trace [2018-06-26 20:33:41,783 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:41,783 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:41,784 INFO ]: Analyzing trace with hash -307628875, now seen corresponding path program 1 times [2018-06-26 20:33:41,784 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:41,784 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:41,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:41,784 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:41,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:41,849 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:41,977 INFO ]: Checked inductivity of 153 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 20:33:41,978 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:41,978 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:41,978 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:41,978 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:41,978 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:41,978 INFO ]: Start difference. First operand 707 states and 1717 transitions. Second operand 3 states. [2018-06-26 20:33:42,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:42,401 INFO ]: Finished difference Result 856 states and 2012 transitions. [2018-06-26 20:33:42,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:42,401 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-26 20:33:42,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:42,405 INFO ]: With dead ends: 856 [2018-06-26 20:33:42,405 INFO ]: Without dead ends: 854 [2018-06-26 20:33:42,405 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 12 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-26 20:33:42,405 INFO ]: Start minimizeSevpa. Operand 854 states. [2018-06-26 20:33:42,426 INFO ]: Finished minimizeSevpa. Reduced states from 854 to 829. [2018-06-26 20:33:42,426 INFO ]: Start removeUnreachable. Operand 829 states. [2018-06-26 20:33:42,430 INFO ]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1965 transitions. [2018-06-26 20:33:42,430 INFO ]: Start accepts. Automaton has 829 states and 1965 transitions. Word has length 22 [2018-06-26 20:33:42,430 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:42,430 INFO ]: Abstraction has 829 states and 1965 transitions. [2018-06-26 20:33:42,430 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:42,430 INFO ]: Start isEmpty. Operand 829 states and 1965 transitions. [2018-06-26 20:33:42,433 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 20:33:42,433 INFO ]: Found error trace [2018-06-26 20:33:42,433 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:42,433 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:42,434 INFO ]: Analyzing trace with hash 30380903, now seen corresponding path program 1 times [2018-06-26 20:33:42,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:42,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:42,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:42,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:42,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:42,484 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:42,573 INFO ]: Checked inductivity of 253 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-06-26 20:33:42,573 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:42,573 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:42,574 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:42,574 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:42,574 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:42,574 INFO ]: Start difference. First operand 829 states and 1965 transitions. Second operand 3 states. [2018-06-26 20:33:43,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:43,511 INFO ]: Finished difference Result 1077 states and 2311 transitions. [2018-06-26 20:33:43,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:43,511 INFO ]: Start accepts. Automaton has 3 states. Word has length 27 [2018-06-26 20:33:43,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:43,514 INFO ]: With dead ends: 1077 [2018-06-26 20:33:43,514 INFO ]: Without dead ends: 1041 [2018-06-26 20:33:43,514 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-26 20:33:43,514 INFO ]: Start minimizeSevpa. Operand 1041 states. [2018-06-26 20:33:43,535 INFO ]: Finished minimizeSevpa. Reduced states from 1041 to 933. [2018-06-26 20:33:43,535 INFO ]: Start removeUnreachable. Operand 933 states. [2018-06-26 20:33:43,538 INFO ]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1999 transitions. [2018-06-26 20:33:43,539 INFO ]: Start accepts. Automaton has 933 states and 1999 transitions. Word has length 27 [2018-06-26 20:33:43,540 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:43,540 INFO ]: Abstraction has 933 states and 1999 transitions. [2018-06-26 20:33:43,540 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:43,540 INFO ]: Start isEmpty. Operand 933 states and 1999 transitions. [2018-06-26 20:33:43,543 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 20:33:43,543 INFO ]: Found error trace [2018-06-26 20:33:43,543 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:43,543 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:43,543 INFO ]: Analyzing trace with hash 2114125350, now seen corresponding path program 1 times [2018-06-26 20:33:43,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:43,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:43,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:43,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:43,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:43,590 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:43,721 INFO ]: Checked inductivity of 253 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-26 20:33:43,721 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:43,721 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:43,721 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:43,721 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:43,721 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:43,721 INFO ]: Start difference. First operand 933 states and 1999 transitions. Second operand 3 states. [2018-06-26 20:33:44,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:44,509 INFO ]: Finished difference Result 949 states and 1929 transitions. [2018-06-26 20:33:44,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:44,509 INFO ]: Start accepts. Automaton has 3 states. Word has length 27 [2018-06-26 20:33:44,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:44,511 INFO ]: With dead ends: 949 [2018-06-26 20:33:44,511 INFO ]: Without dead ends: 796 [2018-06-26 20:33:44,511 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:44,511 INFO ]: Start minimizeSevpa. Operand 796 states. [2018-06-26 20:33:44,524 INFO ]: Finished minimizeSevpa. Reduced states from 796 to 628. [2018-06-26 20:33:44,524 INFO ]: Start removeUnreachable. Operand 628 states. [2018-06-26 20:33:44,526 INFO ]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1132 transitions. [2018-06-26 20:33:44,526 INFO ]: Start accepts. Automaton has 628 states and 1132 transitions. Word has length 27 [2018-06-26 20:33:44,526 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:44,526 INFO ]: Abstraction has 628 states and 1132 transitions. [2018-06-26 20:33:44,526 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:44,526 INFO ]: Start isEmpty. Operand 628 states and 1132 transitions. [2018-06-26 20:33:44,528 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 20:33:44,528 INFO ]: Found error trace [2018-06-26 20:33:44,528 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:44,528 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:44,528 INFO ]: Analyzing trace with hash 1021817641, now seen corresponding path program 1 times [2018-06-26 20:33:44,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:44,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:44,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:44,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:44,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:44,576 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:44,706 INFO ]: Checked inductivity of 253 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-26 20:33:44,706 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:44,706 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:44,706 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:44,706 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:44,707 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:44,707 INFO ]: Start difference. First operand 628 states and 1132 transitions. Second operand 3 states. [2018-06-26 20:33:45,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:45,827 INFO ]: Finished difference Result 748 states and 1327 transitions. [2018-06-26 20:33:45,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:45,828 INFO ]: Start accepts. Automaton has 3 states. Word has length 27 [2018-06-26 20:33:45,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:45,830 INFO ]: With dead ends: 748 [2018-06-26 20:33:45,830 INFO ]: Without dead ends: 748 [2018-06-26 20:33:45,830 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:45,830 INFO ]: Start minimizeSevpa. Operand 748 states. [2018-06-26 20:33:45,841 INFO ]: Finished minimizeSevpa. Reduced states from 748 to 736. [2018-06-26 20:33:45,842 INFO ]: Start removeUnreachable. Operand 736 states. [2018-06-26 20:33:45,844 INFO ]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1312 transitions. [2018-06-26 20:33:45,844 INFO ]: Start accepts. Automaton has 736 states and 1312 transitions. Word has length 27 [2018-06-26 20:33:45,844 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:45,844 INFO ]: Abstraction has 736 states and 1312 transitions. [2018-06-26 20:33:45,844 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:45,844 INFO ]: Start isEmpty. Operand 736 states and 1312 transitions. [2018-06-26 20:33:45,846 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 20:33:45,846 INFO ]: Found error trace [2018-06-26 20:33:45,846 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:45,846 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:45,847 INFO ]: Analyzing trace with hash 2130209262, now seen corresponding path program 1 times [2018-06-26 20:33:45,847 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:45,847 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:45,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:45,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:45,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:45,918 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:46,046 INFO ]: Checked inductivity of 276 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-26 20:33:46,046 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:46,046 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:46,047 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:46,047 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:46,047 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:46,047 INFO ]: Start difference. First operand 736 states and 1312 transitions. Second operand 3 states. [2018-06-26 20:33:47,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:47,985 INFO ]: Finished difference Result 773 states and 1343 transitions. [2018-06-26 20:33:47,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:47,985 INFO ]: Start accepts. Automaton has 3 states. Word has length 28 [2018-06-26 20:33:47,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:47,986 INFO ]: With dead ends: 773 [2018-06-26 20:33:47,986 INFO ]: Without dead ends: 702 [2018-06-26 20:33:47,987 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 13 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-26 20:33:47,987 INFO ]: Start minimizeSevpa. Operand 702 states. [2018-06-26 20:33:47,996 INFO ]: Finished minimizeSevpa. Reduced states from 702 to 619. [2018-06-26 20:33:47,996 INFO ]: Start removeUnreachable. Operand 619 states. [2018-06-26 20:33:47,998 INFO ]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1091 transitions. [2018-06-26 20:33:47,998 INFO ]: Start accepts. Automaton has 619 states and 1091 transitions. Word has length 28 [2018-06-26 20:33:47,998 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:47,998 INFO ]: Abstraction has 619 states and 1091 transitions. [2018-06-26 20:33:47,998 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:47,998 INFO ]: Start isEmpty. Operand 619 states and 1091 transitions. [2018-06-26 20:33:47,999 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 20:33:48,000 INFO ]: Found error trace [2018-06-26 20:33:48,000 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:48,000 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:48,000 INFO ]: Analyzing trace with hash -1064506295, now seen corresponding path program 1 times [2018-06-26 20:33:48,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:48,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:48,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:48,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:48,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:48,130 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:48,427 INFO ]: Checked inductivity of 300 backedges. 171 proven. 59 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-26 20:33:48,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:33:48,427 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-26 20:33:48,436 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-26 20:33:49,297 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:49,327 INFO ]: Computing forward predicates... [2018-06-26 20:33:49,382 INFO ]: Checked inductivity of 300 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-26 20:33:49,415 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 20:33:49,415 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-26 20:33:49,415 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:33:49,415 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:33:49,415 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:33:49,415 INFO ]: Start difference. First operand 619 states and 1091 transitions. Second operand 6 states. [2018-06-26 20:33:50,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:50,346 INFO ]: Finished difference Result 1344 states and 2203 transitions. [2018-06-26 20:33:50,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 20:33:50,346 INFO ]: Start accepts. Automaton has 6 states. Word has length 29 [2018-06-26 20:33:50,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:50,349 INFO ]: With dead ends: 1344 [2018-06-26 20:33:50,349 INFO ]: Without dead ends: 882 [2018-06-26 20:33:50,349 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-26 20:33:50,349 INFO ]: Start minimizeSevpa. Operand 882 states. [2018-06-26 20:33:50,359 INFO ]: Finished minimizeSevpa. Reduced states from 882 to 517. [2018-06-26 20:33:50,359 INFO ]: Start removeUnreachable. Operand 517 states. [2018-06-26 20:33:50,361 INFO ]: Finished removeUnreachable. Reduced from 517 states to 517 states and 927 transitions. [2018-06-26 20:33:50,361 INFO ]: Start accepts. Automaton has 517 states and 927 transitions. Word has length 29 [2018-06-26 20:33:50,361 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:50,361 INFO ]: Abstraction has 517 states and 927 transitions. [2018-06-26 20:33:50,361 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:33:50,361 INFO ]: Start isEmpty. Operand 517 states and 927 transitions. [2018-06-26 20:33:50,363 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 20:33:50,363 INFO ]: Found error trace [2018-06-26 20:33:50,363 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:50,363 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:50,363 INFO ]: Analyzing trace with hash 1378662254, now seen corresponding path program 1 times [2018-06-26 20:33:50,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:50,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:50,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:50,364 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:50,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:50,513 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:50,645 INFO ]: Checked inductivity of 435 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-06-26 20:33:50,645 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:50,645 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:50,645 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:50,645 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:50,645 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:50,645 INFO ]: Start difference. First operand 517 states and 927 transitions. Second operand 3 states. [2018-06-26 20:33:52,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:52,257 INFO ]: Finished difference Result 619 states and 1012 transitions. [2018-06-26 20:33:52,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:52,257 INFO ]: Start accepts. Automaton has 3 states. Word has length 34 [2018-06-26 20:33:52,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:52,258 INFO ]: With dead ends: 619 [2018-06-26 20:33:52,258 INFO ]: Without dead ends: 460 [2018-06-26 20:33:52,259 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 9 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-26 20:33:52,259 INFO ]: Start minimizeSevpa. Operand 460 states. [2018-06-26 20:33:52,264 INFO ]: Finished minimizeSevpa. Reduced states from 460 to 446. [2018-06-26 20:33:52,264 INFO ]: Start removeUnreachable. Operand 446 states. [2018-06-26 20:33:52,266 INFO ]: Finished removeUnreachable. Reduced from 446 states to 446 states and 721 transitions. [2018-06-26 20:33:52,266 INFO ]: Start accepts. Automaton has 446 states and 721 transitions. Word has length 34 [2018-06-26 20:33:52,266 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:52,266 INFO ]: Abstraction has 446 states and 721 transitions. [2018-06-26 20:33:52,266 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:52,266 INFO ]: Start isEmpty. Operand 446 states and 721 transitions. [2018-06-26 20:33:52,267 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 20:33:52,267 INFO ]: Found error trace [2018-06-26 20:33:52,267 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:52,267 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:52,268 INFO ]: Analyzing trace with hash 975404763, now seen corresponding path program 1 times [2018-06-26 20:33:52,268 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:52,268 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:52,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:52,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:52,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:52,354 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:52,563 INFO ]: Checked inductivity of 435 backedges. 248 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-26 20:33:52,563 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:33:52,563 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) [2018-06-26 20:33:52,577 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:33:53,538 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:53,577 INFO ]: Computing forward predicates... [2018-06-26 20:33:53,616 INFO ]: Checked inductivity of 435 backedges. 248 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-26 20:33:53,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:33:53,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 20:33:53,642 INFO ]: Interpolant automaton has 4 states [2018-06-26 20:33:53,642 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 20:33:53,642 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:33:53,642 INFO ]: Start difference. First operand 446 states and 721 transitions. Second operand 4 states. [2018-06-26 20:33:54,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:54,072 INFO ]: Finished difference Result 645 states and 986 transitions. [2018-06-26 20:33:54,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 20:33:54,072 INFO ]: Start accepts. Automaton has 4 states. Word has length 34 [2018-06-26 20:33:54,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:54,073 INFO ]: With dead ends: 645 [2018-06-26 20:33:54,073 INFO ]: Without dead ends: 632 [2018-06-26 20:33:54,073 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:33:54,074 INFO ]: Start minimizeSevpa. Operand 632 states. [2018-06-26 20:33:54,079 INFO ]: Finished minimizeSevpa. Reduced states from 632 to 446. [2018-06-26 20:33:54,079 INFO ]: Start removeUnreachable. Operand 446 states. [2018-06-26 20:33:54,080 INFO ]: Finished removeUnreachable. Reduced from 446 states to 446 states and 721 transitions. [2018-06-26 20:33:54,080 INFO ]: Start accepts. Automaton has 446 states and 721 transitions. Word has length 34 [2018-06-26 20:33:54,080 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:54,080 INFO ]: Abstraction has 446 states and 721 transitions. [2018-06-26 20:33:54,080 INFO ]: Interpolant automaton has 4 states. [2018-06-26 20:33:54,080 INFO ]: Start isEmpty. Operand 446 states and 721 transitions. [2018-06-26 20:33:54,081 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 20:33:54,081 INFO ]: Found error trace [2018-06-26 20:33:54,081 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:54,082 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:54,082 INFO ]: Analyzing trace with hash -1325527269, now seen corresponding path program 1 times [2018-06-26 20:33:54,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:54,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:54,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:54,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:54,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:54,175 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:54,816 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 5 [2018-06-26 20:33:54,887 INFO ]: Checked inductivity of 435 backedges. 152 proven. 233 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-26 20:33:54,887 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:33:54,887 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:33:54,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:55,813 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:55,851 INFO ]: Computing forward predicates... [2018-06-26 20:33:55,881 INFO ]: Checked inductivity of 435 backedges. 131 proven. 213 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-26 20:33:55,917 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:33:55,917 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2018-06-26 20:33:55,917 INFO ]: Interpolant automaton has 10 states [2018-06-26 20:33:55,917 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 20:33:55,917 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 20:33:55,917 INFO ]: Start difference. First operand 446 states and 721 transitions. Second operand 10 states. [2018-06-26 20:33:57,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:57,518 INFO ]: Finished difference Result 982 states and 1472 transitions. [2018-06-26 20:33:57,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 20:33:57,518 INFO ]: Start accepts. Automaton has 10 states. Word has length 34 [2018-06-26 20:33:57,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:57,520 INFO ]: With dead ends: 982 [2018-06-26 20:33:57,520 INFO ]: Without dead ends: 967 [2018-06-26 20:33:57,520 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-06-26 20:33:57,521 INFO ]: Start minimizeSevpa. Operand 967 states. [2018-06-26 20:33:57,525 INFO ]: Finished minimizeSevpa. Reduced states from 967 to 557. [2018-06-26 20:33:57,525 INFO ]: Start removeUnreachable. Operand 557 states. [2018-06-26 20:33:57,526 INFO ]: Finished removeUnreachable. Reduced from 557 states to 557 states and 912 transitions. [2018-06-26 20:33:57,526 INFO ]: Start accepts. Automaton has 557 states and 912 transitions. Word has length 34 [2018-06-26 20:33:57,526 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:57,526 INFO ]: Abstraction has 557 states and 912 transitions. [2018-06-26 20:33:57,526 INFO ]: Interpolant automaton has 10 states. [2018-06-26 20:33:57,526 INFO ]: Start isEmpty. Operand 557 states and 912 transitions. [2018-06-26 20:33:57,528 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 20:33:57,528 INFO ]: Found error trace [2018-06-26 20:33:57,528 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:33:57,528 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:57,528 INFO ]: Analyzing trace with hash -1127822926, now seen corresponding path program 1 times [2018-06-26 20:33:57,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:57,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:57,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:57,529 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:57,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:57,625 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:57,744 INFO ]: Checked inductivity of 703 backedges. 360 proven. 39 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2018-06-26 20:33:57,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:33:57,745 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:33:57,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:58,982 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:59,012 INFO ]: Computing forward predicates... [2018-06-26 20:33:59,026 INFO ]: Checked inductivity of 703 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-06-26 20:33:59,053 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 20:33:59,053 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-26 20:33:59,053 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:33:59,053 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:33:59,053 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:33:59,053 INFO ]: Start difference. First operand 557 states and 912 transitions. Second operand 6 states. [2018-06-26 20:34:00,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:00,075 INFO ]: Finished difference Result 740 states and 1103 transitions. [2018-06-26 20:34:00,075 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 20:34:00,075 INFO ]: Start accepts. Automaton has 6 states. Word has length 42 [2018-06-26 20:34:00,075 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:00,076 INFO ]: With dead ends: 740 [2018-06-26 20:34:00,076 INFO ]: Without dead ends: 503 [2018-06-26 20:34:00,076 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-26 20:34:00,077 INFO ]: Start minimizeSevpa. Operand 503 states. [2018-06-26 20:34:00,080 INFO ]: Finished minimizeSevpa. Reduced states from 503 to 456. [2018-06-26 20:34:00,080 INFO ]: Start removeUnreachable. Operand 456 states. [2018-06-26 20:34:00,082 INFO ]: Finished removeUnreachable. Reduced from 456 states to 456 states and 673 transitions. [2018-06-26 20:34:00,082 INFO ]: Start accepts. Automaton has 456 states and 673 transitions. Word has length 42 [2018-06-26 20:34:00,082 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:00,082 INFO ]: Abstraction has 456 states and 673 transitions. [2018-06-26 20:34:00,082 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:34:00,082 INFO ]: Start isEmpty. Operand 456 states and 673 transitions. [2018-06-26 20:34:00,083 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-26 20:34:00,083 INFO ]: Found error trace [2018-06-26 20:34:00,083 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:00,083 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:00,083 INFO ]: Analyzing trace with hash 358342056, now seen corresponding path program 1 times [2018-06-26 20:34:00,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:00,083 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:00,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:00,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:00,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:00,153 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:00,360 INFO ]: Checked inductivity of 780 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-06-26 20:34:00,361 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:00,361 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:00,361 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:00,361 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:00,361 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:00,361 INFO ]: Start difference. First operand 456 states and 673 transitions. Second operand 3 states. [2018-06-26 20:34:00,834 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:00,834 INFO ]: Finished difference Result 541 states and 787 transitions. [2018-06-26 20:34:00,834 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:00,834 INFO ]: Start accepts. Automaton has 3 states. Word has length 44 [2018-06-26 20:34:00,834 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:00,835 INFO ]: With dead ends: 541 [2018-06-26 20:34:00,835 INFO ]: Without dead ends: 524 [2018-06-26 20:34:00,835 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:00,836 INFO ]: Start minimizeSevpa. Operand 524 states. [2018-06-26 20:34:00,840 INFO ]: Finished minimizeSevpa. Reduced states from 524 to 466. [2018-06-26 20:34:00,840 INFO ]: Start removeUnreachable. Operand 466 states. [2018-06-26 20:34:00,842 INFO ]: Finished removeUnreachable. Reduced from 466 states to 466 states and 684 transitions. [2018-06-26 20:34:00,842 INFO ]: Start accepts. Automaton has 466 states and 684 transitions. Word has length 44 [2018-06-26 20:34:00,842 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:00,842 INFO ]: Abstraction has 466 states and 684 transitions. [2018-06-26 20:34:00,842 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:00,842 INFO ]: Start isEmpty. Operand 466 states and 684 transitions. [2018-06-26 20:34:00,843 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-26 20:34:00,843 INFO ]: Found error trace [2018-06-26 20:34:00,843 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:00,843 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:00,843 INFO ]: Analyzing trace with hash -1249631721, now seen corresponding path program 1 times [2018-06-26 20:34:00,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:00,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:00,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:00,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:00,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:00,932 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:01,294 INFO ]: Checked inductivity of 820 backedges. 452 proven. 161 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-06-26 20:34:01,294 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:34:01,294 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:34:01,301 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:02,588 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:02,628 INFO ]: Computing forward predicates... [2018-06-26 20:34:02,692 INFO ]: Checked inductivity of 820 backedges. 452 proven. 145 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-06-26 20:34:02,719 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:34:02,720 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-26 20:34:02,720 INFO ]: Interpolant automaton has 9 states [2018-06-26 20:34:02,720 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 20:34:02,720 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-26 20:34:02,720 INFO ]: Start difference. First operand 466 states and 684 transitions. Second operand 9 states. [2018-06-26 20:34:03,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:03,598 INFO ]: Finished difference Result 930 states and 1267 transitions. [2018-06-26 20:34:03,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 20:34:03,598 INFO ]: Start accepts. Automaton has 9 states. Word has length 45 [2018-06-26 20:34:03,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:03,600 INFO ]: With dead ends: 930 [2018-06-26 20:34:03,600 INFO ]: Without dead ends: 685 [2018-06-26 20:34:03,600 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-26 20:34:03,600 INFO ]: Start minimizeSevpa. Operand 685 states. [2018-06-26 20:34:03,603 INFO ]: Finished minimizeSevpa. Reduced states from 685 to 497. [2018-06-26 20:34:03,603 INFO ]: Start removeUnreachable. Operand 497 states. [2018-06-26 20:34:03,604 INFO ]: Finished removeUnreachable. Reduced from 497 states to 497 states and 725 transitions. [2018-06-26 20:34:03,604 INFO ]: Start accepts. Automaton has 497 states and 725 transitions. Word has length 45 [2018-06-26 20:34:03,604 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:03,604 INFO ]: Abstraction has 497 states and 725 transitions. [2018-06-26 20:34:03,604 INFO ]: Interpolant automaton has 9 states. [2018-06-26 20:34:03,604 INFO ]: Start isEmpty. Operand 497 states and 725 transitions. [2018-06-26 20:34:03,605 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-26 20:34:03,605 INFO ]: Found error trace [2018-06-26 20:34:03,605 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:03,605 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:03,606 INFO ]: Analyzing trace with hash 1694404564, now seen corresponding path program 1 times [2018-06-26 20:34:03,606 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:03,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:03,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:03,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:03,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:03,730 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:03,925 INFO ]: Checked inductivity of 820 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-06-26 20:34:03,925 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:34:03,925 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:34:03,925 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:34:03,925 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:34:03,925 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:34:03,925 INFO ]: Start difference. First operand 497 states and 725 transitions. Second operand 3 states. [2018-06-26 20:34:04,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:04,346 INFO ]: Finished difference Result 525 states and 760 transitions. [2018-06-26 20:34:04,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:34:04,346 INFO ]: Start accepts. Automaton has 3 states. Word has length 45 [2018-06-26 20:34:04,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:04,347 INFO ]: With dead ends: 525 [2018-06-26 20:34:04,347 INFO ]: Without dead ends: 257 [2018-06-26 20:34:04,347 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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-26 20:34:04,347 INFO ]: Start minimizeSevpa. Operand 257 states. [2018-06-26 20:34:04,348 INFO ]: Finished minimizeSevpa. Reduced states from 257 to 240. [2018-06-26 20:34:04,348 INFO ]: Start removeUnreachable. Operand 240 states. [2018-06-26 20:34:04,349 INFO ]: Finished removeUnreachable. Reduced from 240 states to 240 states and 338 transitions. [2018-06-26 20:34:04,349 INFO ]: Start accepts. Automaton has 240 states and 338 transitions. Word has length 45 [2018-06-26 20:34:04,349 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:04,349 INFO ]: Abstraction has 240 states and 338 transitions. [2018-06-26 20:34:04,349 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:34:04,349 INFO ]: Start isEmpty. Operand 240 states and 338 transitions. [2018-06-26 20:34:04,349 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 20:34:04,349 INFO ]: Found error trace [2018-06-26 20:34:04,350 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:04,350 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:04,350 INFO ]: Analyzing trace with hash 296659512, now seen corresponding path program 1 times [2018-06-26 20:34:04,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:04,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:04,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:04,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:04,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:04,462 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:04,875 INFO ]: Checked inductivity of 1035 backedges. 669 proven. 92 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-06-26 20:34:04,875 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:34:04,875 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:34:04,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:06,360 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:34:06,416 INFO ]: Computing forward predicates... [2018-06-26 20:34:07,683 INFO ]: Checked inductivity of 1035 backedges. 704 proven. 57 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-06-26 20:34:07,726 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:34:07,726 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-26 20:34:07,726 INFO ]: Interpolant automaton has 13 states [2018-06-26 20:34:07,726 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 20:34:07,726 INFO ]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-26 20:34:07,726 INFO ]: Start difference. First operand 240 states and 338 transitions. Second operand 13 states. [2018-06-26 20:34:09,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:34:09,400 INFO ]: Finished difference Result 374 states and 518 transitions. [2018-06-26 20:34:09,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 20:34:09,400 INFO ]: Start accepts. Automaton has 13 states. Word has length 50 [2018-06-26 20:34:09,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:34:09,401 INFO ]: With dead ends: 374 [2018-06-26 20:34:09,401 INFO ]: Without dead ends: 350 [2018-06-26 20:34:09,401 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-26 20:34:09,401 INFO ]: Start minimizeSevpa. Operand 350 states. [2018-06-26 20:34:09,403 INFO ]: Finished minimizeSevpa. Reduced states from 350 to 230. [2018-06-26 20:34:09,403 INFO ]: Start removeUnreachable. Operand 230 states. [2018-06-26 20:34:09,403 INFO ]: Finished removeUnreachable. Reduced from 230 states to 230 states and 323 transitions. [2018-06-26 20:34:09,403 INFO ]: Start accepts. Automaton has 230 states and 323 transitions. Word has length 50 [2018-06-26 20:34:09,403 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:34:09,403 INFO ]: Abstraction has 230 states and 323 transitions. [2018-06-26 20:34:09,403 INFO ]: Interpolant automaton has 13 states. [2018-06-26 20:34:09,403 INFO ]: Start isEmpty. Operand 230 states and 323 transitions. [2018-06-26 20:34:09,404 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-26 20:34:09,404 INFO ]: Found error trace [2018-06-26 20:34:09,404 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:34:09,404 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:34:09,404 INFO ]: Analyzing trace with hash 1326652573, now seen corresponding path program 1 times [2018-06-26 20:34:09,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:34:09,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:34:09,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:09,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:34:09,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:34:09,462 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-26 20:34:09,544 WARN ]: Removed 1 from assertion stack [2018-06-26 20:34:09,544 WARN ]: Verification canceled [2018-06-26 20:34:09,546 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:34:09,547 WARN ]: Timeout [2018-06-26 20:34:09,548 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:34:09 BasicIcfg [2018-06-26 20:34:09,553 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:34:09,554 INFO ]: Toolchain (without parser) took 53153.60 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 835.2 MB). Free memory was 193.3 MB in the beginning and 546.5 MB in the end (delta: -353.2 MB). Peak memory consumption was 482.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:34:09,555 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:34:09,555 INFO ]: ChcToBoogie took 107.23 ms. Allocated memory was 308.8 MB in the beginning and 321.9 MB in the end (delta: 13.1 MB). Free memory was 193.3 MB in the beginning and 295.1 MB in the end (delta: -101.8 MB). Peak memory consumption was 8.2 MB. Max. memory is 3.6 GB. [2018-06-26 20:34:09,555 INFO ]: Boogie Preprocessor took 78.17 ms. Allocated memory is still 321.9 MB. Free memory was 295.1 MB in the beginning and 291.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 3.6 GB. [2018-06-26 20:34:09,556 INFO ]: RCFGBuilder took 600.66 ms. Allocated memory is still 321.9 MB. Free memory was 291.3 MB in the beginning and 218.0 MB in the end (delta: 73.3 MB). Peak memory consumption was 73.3 MB. Max. memory is 3.6 GB. [2018-06-26 20:34:09,556 INFO ]: BlockEncodingV2 took 583.03 ms. Allocated memory was 321.9 MB in the beginning and 370.7 MB in the end (delta: 48.8 MB). Free memory was 218.0 MB in the beginning and 273.6 MB in the end (delta: -55.6 MB). Peak memory consumption was 52.9 MB. Max. memory is 3.6 GB. [2018-06-26 20:34:09,556 INFO ]: TraceAbstraction took 51774.86 ms. Allocated memory was 370.7 MB in the beginning and 1.1 GB in the end (delta: 773.3 MB). Free memory was 271.2 MB in the beginning and 546.5 MB in the end (delta: -275.3 MB). Peak memory consumption was 498.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:34:09,566 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, 99 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 107.23 ms. Allocated memory was 308.8 MB in the beginning and 321.9 MB in the end (delta: 13.1 MB). Free memory was 193.3 MB in the beginning and 295.1 MB in the end (delta: -101.8 MB). Peak memory consumption was 8.2 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 78.17 ms. Allocated memory is still 321.9 MB. Free memory was 295.1 MB in the beginning and 291.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 3.6 GB. * RCFGBuilder took 600.66 ms. Allocated memory is still 321.9 MB. Free memory was 291.3 MB in the beginning and 218.0 MB in the end (delta: 73.3 MB). Peak memory consumption was 73.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 583.03 ms. Allocated memory was 321.9 MB in the beginning and 370.7 MB in the end (delta: 48.8 MB). Free memory was 218.0 MB in the beginning and 273.6 MB in the end (delta: -55.6 MB). Peak memory consumption was 52.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 51774.86 ms. Allocated memory was 370.7 MB in the beginning and 1.1 GB in the end (delta: 773.3 MB). Free memory was 271.2 MB in the beginning and 546.5 MB in the end (delta: -275.3 MB). Peak memory consumption was 498.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 4. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 51.6s OverallTime, 37 OverallIterations, 3 TraceHistogramMax, 32.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 5 SDslu, 250 SDs, 0 SdLazy, 10513 SolverSat, 2985 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 578 GetRequests, 461 SyntacticMatches, 15 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1247occurred in iteration=19, 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.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 3051 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 3.1s SsaConstructionTime, 6.7s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1010 NumberOfCodeBlocks, 1010 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 966 ConstructedInterpolants, 0 QuantifiedInterpolants, 58418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 63836 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 44 InterpolantComputations, 31 PerfectInterpolantSequences, 10540/11600 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-34-09-579.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-34-09-579.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-34-09-579.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-34-09-579.csv Completed graceful shutdown