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/array_max-3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:22:51,334 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:22:51,336 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:22:51,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:22:51,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:22:51,348 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:22:51,349 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:22:51,351 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:22:51,352 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:22:51,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:22:51,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:22:51,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:22:51,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:22:51,358 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:22:51,361 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:22:51,362 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:22:51,362 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:22:51,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:22:51,365 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:22:51,368 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:22:51,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:22:51,369 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:22:51,372 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:22:51,372 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:22:51,372 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:22:51,373 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:22:51,374 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:22:51,375 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:22:51,375 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:22:51,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:22:51,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:22:51,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:22:51,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:22:51,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:22:51,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:22:51,379 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:22:51,379 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:22:51,393 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:22:51,393 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:22:51,393 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:22:51,393 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:22:51,394 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:22:51,395 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:22:51,395 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:22:51,395 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:22:51,395 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:22:51,396 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:22:51,396 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:22:51,396 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:22:51,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:22:51,396 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:22:51,397 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:22:51,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:22:51,397 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:22:51,397 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:22:51,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:22:51,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:22:51,398 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:22:51,400 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:22:51,400 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:22:51,433 INFO ]: Repository-Root is: /tmp [2018-06-26 20:22:51,446 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:22:51,451 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:22:51,453 INFO ]: Initializing SmtParser... [2018-06-26 20:22:51,453 INFO ]: SmtParser initialized [2018-06-26 20:22:51,454 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/array_max-3.smt2 [2018-06-26 20:22:51,455 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:22:51,553 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/array_max-3.smt2 unknown [2018-06-26 20:22:52,029 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/array_max-3.smt2 [2018-06-26 20:22:52,033 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:22:52,051 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:22:52,051 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:22:52,051 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:22:52,051 INFO ]: ChcToBoogie initialized [2018-06-26 20:22:52,054 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:22:52" (1/1) ... [2018-06-26 20:22:52,125 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:22:52 Unit [2018-06-26 20:22:52,125 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:22:52,126 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:22:52,126 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:22:52,126 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:22:52,147 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:22:52" (1/1) ... [2018-06-26 20:22:52,148 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:22:52" (1/1) ... [2018-06-26 20:22:52,157 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:22:52" (1/1) ... [2018-06-26 20:22:52,157 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:22:52" (1/1) ... [2018-06-26 20:22:52,169 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:22:52" (1/1) ... [2018-06-26 20:22:52,171 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:22:52" (1/1) ... [2018-06-26 20:22:52,174 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:22:52" (1/1) ... [2018-06-26 20:22:52,179 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:22:52,180 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:22:52,180 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:22:52,180 INFO ]: RCFGBuilder initialized [2018-06-26 20:22:52,180 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:22:52" (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:22:52,193 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:22:52,193 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:22:52,193 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:22:52,194 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:22:52,194 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:22:52,194 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:22:52,615 INFO ]: Using library mode [2018-06-26 20:22:52,615 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:22:52 BoogieIcfgContainer [2018-06-26 20:22:52,615 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:22:52,618 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:22:52,618 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:22:52,619 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:22:52,619 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:22:52" (1/1) ... [2018-06-26 20:22:52,635 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:22:52,636 INFO ]: Using Remove infeasible edges [2018-06-26 20:22:52,637 INFO ]: Using Maximize final states [2018-06-26 20:22:52,638 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:22:52,638 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:22:52,640 INFO ]: Using Remove sink states [2018-06-26 20:22:52,640 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:22:52,641 INFO ]: Using Use SBE [2018-06-26 20:22:59,919 INFO ]: SBE split 1 edges [2018-06-26 20:23:02,394 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:23:02,401 INFO ]: 0 new accepting states [2018-06-26 20:23:02,481 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:23:02,486 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:23:11,019 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:23:11,021 INFO ]: 0 new accepting states [2018-06-26 20:23:11,025 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:23:11,026 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:23:15,118 INFO ]: Encoded RCFG 6 locations, 7430 edges [2018-06-26 20:23:15,119 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:23:15 BasicIcfg [2018-06-26 20:23:15,119 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:23:15,122 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:23:15,122 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:23:15,125 INFO ]: TraceAbstraction initialized [2018-06-26 20:23:15,126 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:22:52" (1/4) ... [2018-06-26 20:23:15,127 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382f071c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:23:15, skipping insertion in model container [2018-06-26 20:23:15,127 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:22:52" (2/4) ... [2018-06-26 20:23:15,127 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382f071c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:23:15, skipping insertion in model container [2018-06-26 20:23:15,127 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:22:52" (3/4) ... [2018-06-26 20:23:15,127 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382f071c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:23:15, skipping insertion in model container [2018-06-26 20:23:15,127 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:23:15" (4/4) ... [2018-06-26 20:23:15,129 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:23:15,139 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:23:15,149 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:23:15,302 INFO ]: Using default assertion order modulation [2018-06-26 20:23:15,303 INFO ]: Interprodecural is true [2018-06-26 20:23:15,303 INFO ]: Hoare is false [2018-06-26 20:23:15,303 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:23:15,303 INFO ]: Backedges is TWOTRACK [2018-06-26 20:23:15,303 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:23:15,303 INFO ]: Difference is false [2018-06-26 20:23:15,303 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:23:15,303 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:23:15,331 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:23:15,367 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:23:15,367 INFO ]: Found error trace [2018-06-26 20:23:15,368 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:23:15,368 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:15,373 INFO ]: Analyzing trace with hash 263736162, now seen corresponding path program 1 times [2018-06-26 20:23:15,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:15,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:15,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:15,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:15,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:15,477 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:15,556 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:23:15,558 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:15,558 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:15,559 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:15,570 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:15,570 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:15,572 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:23:39,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:39,466 INFO ]: Finished difference Result 7 states and 55 transitions. [2018-06-26 20:23:39,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:39,468 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:23:39,468 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:39,476 INFO ]: With dead ends: 7 [2018-06-26 20:23:39,476 INFO ]: Without dead ends: 7 [2018-06-26 20:23:39,478 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:23:39,491 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:23:39,507 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:23:39,508 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:23:39,508 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2018-06-26 20:23:39,509 INFO ]: Start accepts. Automaton has 7 states and 55 transitions. Word has length 5 [2018-06-26 20:23:39,510 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:39,510 INFO ]: Abstraction has 7 states and 55 transitions. [2018-06-26 20:23:39,510 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:39,510 INFO ]: Start isEmpty. Operand 7 states and 55 transitions. [2018-06-26 20:23:39,510 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:23:39,511 INFO ]: Found error trace [2018-06-26 20:23:39,511 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:23:39,511 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:39,511 INFO ]: Analyzing trace with hash -412874682, now seen corresponding path program 1 times [2018-06-26 20:23:39,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:39,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:39,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:39,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:39,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:39,561 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:39,624 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:23:39,624 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:39,624 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:39,625 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:39,626 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:39,626 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:39,626 INFO ]: Start difference. First operand 7 states and 55 transitions. Second operand 3 states. [2018-06-26 20:23:40,012 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:40,012 INFO ]: Finished difference Result 8 states and 83 transitions. [2018-06-26 20:23:40,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:40,013 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:23:40,013 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:40,013 INFO ]: With dead ends: 8 [2018-06-26 20:23:40,013 INFO ]: Without dead ends: 8 [2018-06-26 20:23:40,014 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:23:40,014 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:23:40,015 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:23:40,015 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:23:40,016 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-06-26 20:23:40,016 INFO ]: Start accepts. Automaton has 8 states and 83 transitions. Word has length 6 [2018-06-26 20:23:40,016 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:40,016 INFO ]: Abstraction has 8 states and 83 transitions. [2018-06-26 20:23:40,016 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:40,016 INFO ]: Start isEmpty. Operand 8 states and 83 transitions. [2018-06-26 20:23:40,016 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:23:40,016 INFO ]: Found error trace [2018-06-26 20:23:40,016 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:23:40,016 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:40,016 INFO ]: Analyzing trace with hash -530072476, now seen corresponding path program 1 times [2018-06-26 20:23:40,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:40,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:40,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:40,017 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:40,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:40,037 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:40,085 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:23:40,085 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:40,085 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:40,085 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:40,085 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:40,085 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:40,085 INFO ]: Start difference. First operand 8 states and 83 transitions. Second operand 3 states. [2018-06-26 20:23:40,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:40,448 INFO ]: Finished difference Result 10 states and 90 transitions. [2018-06-26 20:23:40,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:40,448 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:23:40,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:40,449 INFO ]: With dead ends: 10 [2018-06-26 20:23:40,449 INFO ]: Without dead ends: 10 [2018-06-26 20:23:40,449 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:23:40,449 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 20:23:40,451 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 20:23:40,451 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 20:23:40,452 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2018-06-26 20:23:40,452 INFO ]: Start accepts. Automaton has 10 states and 90 transitions. Word has length 6 [2018-06-26 20:23:40,452 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:40,452 INFO ]: Abstraction has 10 states and 90 transitions. [2018-06-26 20:23:40,452 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:40,452 INFO ]: Start isEmpty. Operand 10 states and 90 transitions. [2018-06-26 20:23:40,452 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:23:40,453 INFO ]: Found error trace [2018-06-26 20:23:40,453 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:40,453 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:40,453 INFO ]: Analyzing trace with hash 22051463, now seen corresponding path program 1 times [2018-06-26 20:23:40,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:40,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:40,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:40,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:40,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:40,485 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:40,532 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:23:40,533 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:40,533 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:40,533 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:40,533 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:40,533 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:40,533 INFO ]: Start difference. First operand 10 states and 90 transitions. Second operand 3 states. [2018-06-26 20:23:40,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:40,727 INFO ]: Finished difference Result 14 states and 97 transitions. [2018-06-26 20:23:40,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:40,727 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:23:40,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:40,728 INFO ]: With dead ends: 14 [2018-06-26 20:23:40,728 INFO ]: Without dead ends: 14 [2018-06-26 20:23:40,728 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:23:40,728 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 20:23:40,731 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-26 20:23:40,731 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:23:40,731 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-06-26 20:23:40,732 INFO ]: Start accepts. Automaton has 13 states and 96 transitions. Word has length 7 [2018-06-26 20:23:40,732 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:40,732 INFO ]: Abstraction has 13 states and 96 transitions. [2018-06-26 20:23:40,732 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:40,732 INFO ]: Start isEmpty. Operand 13 states and 96 transitions. [2018-06-26 20:23:40,732 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:23:40,732 INFO ]: Found error trace [2018-06-26 20:23:40,732 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:40,732 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:40,732 INFO ]: Analyzing trace with hash 541635120, now seen corresponding path program 1 times [2018-06-26 20:23:40,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:40,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:40,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:40,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:40,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:40,750 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:40,789 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:23:40,789 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:40,789 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:40,789 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:40,790 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:40,790 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:40,790 INFO ]: Start difference. First operand 13 states and 96 transitions. Second operand 3 states. [2018-06-26 20:23:40,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:40,879 INFO ]: Finished difference Result 13 states and 89 transitions. [2018-06-26 20:23:40,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:40,879 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:23:40,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:40,880 INFO ]: With dead ends: 13 [2018-06-26 20:23:40,880 INFO ]: Without dead ends: 13 [2018-06-26 20:23:40,880 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:23:40,881 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:23:40,882 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 20:23:40,882 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:23:40,883 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2018-06-26 20:23:40,883 INFO ]: Start accepts. Automaton has 12 states and 87 transitions. Word has length 7 [2018-06-26 20:23:40,883 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:40,883 INFO ]: Abstraction has 12 states and 87 transitions. [2018-06-26 20:23:40,883 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:40,883 INFO ]: Start isEmpty. Operand 12 states and 87 transitions. [2018-06-26 20:23:40,884 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:23:40,884 INFO ]: Found error trace [2018-06-26 20:23:40,884 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:40,884 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:40,884 INFO ]: Analyzing trace with hash 467009201, now seen corresponding path program 1 times [2018-06-26 20:23:40,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:40,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:40,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:40,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:40,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:40,903 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:40,970 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:23:40,970 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:40,970 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:40,970 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:40,970 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:40,970 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:40,970 INFO ]: Start difference. First operand 12 states and 87 transitions. Second operand 3 states. [2018-06-26 20:23:41,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:41,174 INFO ]: Finished difference Result 17 states and 160 transitions. [2018-06-26 20:23:41,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:41,175 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:23:41,175 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:41,175 INFO ]: With dead ends: 17 [2018-06-26 20:23:41,175 INFO ]: Without dead ends: 17 [2018-06-26 20:23:41,176 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:23:41,176 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:23:41,178 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-26 20:23:41,178 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:23:41,178 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 128 transitions. [2018-06-26 20:23:41,178 INFO ]: Start accepts. Automaton has 13 states and 128 transitions. Word has length 8 [2018-06-26 20:23:41,179 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:41,179 INFO ]: Abstraction has 13 states and 128 transitions. [2018-06-26 20:23:41,179 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:41,179 INFO ]: Start isEmpty. Operand 13 states and 128 transitions. [2018-06-26 20:23:41,179 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:23:41,179 INFO ]: Found error trace [2018-06-26 20:23:41,179 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:41,179 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:41,179 INFO ]: Analyzing trace with hash 1132605332, now seen corresponding path program 1 times [2018-06-26 20:23:41,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:41,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:41,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:41,180 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:41,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:41,200 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:41,304 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:23:41,304 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:41,304 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:41,304 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:41,305 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:41,305 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:41,305 INFO ]: Start difference. First operand 13 states and 128 transitions. Second operand 3 states. [2018-06-26 20:23:41,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:41,521 INFO ]: Finished difference Result 18 states and 199 transitions. [2018-06-26 20:23:41,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:41,524 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:23:41,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:41,525 INFO ]: With dead ends: 18 [2018-06-26 20:23:41,525 INFO ]: Without dead ends: 18 [2018-06-26 20:23:41,525 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:23:41,525 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 20:23:41,528 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-06-26 20:23:41,529 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 20:23:41,529 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 167 transitions. [2018-06-26 20:23:41,529 INFO ]: Start accepts. Automaton has 14 states and 167 transitions. Word has length 9 [2018-06-26 20:23:41,529 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:41,529 INFO ]: Abstraction has 14 states and 167 transitions. [2018-06-26 20:23:41,529 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:41,529 INFO ]: Start isEmpty. Operand 14 states and 167 transitions. [2018-06-26 20:23:41,530 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:23:41,530 INFO ]: Found error trace [2018-06-26 20:23:41,530 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:41,530 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:41,530 INFO ]: Analyzing trace with hash 1684562976, now seen corresponding path program 1 times [2018-06-26 20:23:41,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:41,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:41,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:41,531 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:41,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:41,554 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:41,682 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:23:41,682 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:41,682 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:41,682 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:41,682 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:41,682 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:41,682 INFO ]: Start difference. First operand 14 states and 167 transitions. Second operand 3 states. [2018-06-26 20:23:41,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:41,878 INFO ]: Finished difference Result 19 states and 236 transitions. [2018-06-26 20:23:41,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:41,878 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:23:41,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:41,879 INFO ]: With dead ends: 19 [2018-06-26 20:23:41,879 INFO ]: Without dead ends: 19 [2018-06-26 20:23:41,879 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:41,879 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 20:23:41,881 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-26 20:23:41,881 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 20:23:41,882 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 204 transitions. [2018-06-26 20:23:41,882 INFO ]: Start accepts. Automaton has 15 states and 204 transitions. Word has length 10 [2018-06-26 20:23:41,882 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:41,882 INFO ]: Abstraction has 15 states and 204 transitions. [2018-06-26 20:23:41,882 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:41,882 INFO ]: Start isEmpty. Operand 15 states and 204 transitions. [2018-06-26 20:23:41,882 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:23:41,882 INFO ]: Found error trace [2018-06-26 20:23:41,882 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:41,883 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:41,883 INFO ]: Analyzing trace with hash -1613413920, now seen corresponding path program 1 times [2018-06-26 20:23:41,883 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:41,883 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:41,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:41,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:41,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:41,908 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:41,996 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:23:41,996 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:41,996 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:41,997 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:41,997 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:41,997 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:41,997 INFO ]: Start difference. First operand 15 states and 204 transitions. Second operand 3 states. [2018-06-26 20:23:42,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:42,257 INFO ]: Finished difference Result 20 states and 271 transitions. [2018-06-26 20:23:42,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:42,258 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:23:42,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:42,259 INFO ]: With dead ends: 20 [2018-06-26 20:23:42,259 INFO ]: Without dead ends: 20 [2018-06-26 20:23:42,259 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:23:42,259 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 20:23:42,261 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-26 20:23:42,261 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 20:23:42,263 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 239 transitions. [2018-06-26 20:23:42,263 INFO ]: Start accepts. Automaton has 16 states and 239 transitions. Word has length 11 [2018-06-26 20:23:42,263 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:42,263 INFO ]: Abstraction has 16 states and 239 transitions. [2018-06-26 20:23:42,263 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:42,263 INFO ]: Start isEmpty. Operand 16 states and 239 transitions. [2018-06-26 20:23:42,263 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:23:42,263 INFO ]: Found error trace [2018-06-26 20:23:42,263 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:42,264 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:42,264 INFO ]: Analyzing trace with hash 984260141, now seen corresponding path program 1 times [2018-06-26 20:23:42,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:42,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:42,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:42,264 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:42,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:42,305 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:42,445 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:23:42,445 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:42,445 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:42,445 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:42,445 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:42,445 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:42,445 INFO ]: Start difference. First operand 16 states and 239 transitions. Second operand 3 states. [2018-06-26 20:23:43,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:43,320 INFO ]: Finished difference Result 21 states and 304 transitions. [2018-06-26 20:23:43,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:43,321 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:23:43,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:43,322 INFO ]: With dead ends: 21 [2018-06-26 20:23:43,322 INFO ]: Without dead ends: 21 [2018-06-26 20:23:43,322 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:23:43,322 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 20:23:43,324 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-26 20:23:43,324 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:23:43,325 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 272 transitions. [2018-06-26 20:23:43,325 INFO ]: Start accepts. Automaton has 17 states and 272 transitions. Word has length 12 [2018-06-26 20:23:43,325 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:43,325 INFO ]: Abstraction has 17 states and 272 transitions. [2018-06-26 20:23:43,325 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:43,325 INFO ]: Start isEmpty. Operand 17 states and 272 transitions. [2018-06-26 20:23:43,326 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:23:43,326 INFO ]: Found error trace [2018-06-26 20:23:43,326 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:43,326 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:43,326 INFO ]: Analyzing trace with hash -1799763540, now seen corresponding path program 1 times [2018-06-26 20:23:43,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:43,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:43,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:43,327 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:43,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:43,361 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:43,504 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:23:43,504 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:43,504 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:43,504 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:43,504 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:43,504 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:43,504 INFO ]: Start difference. First operand 17 states and 272 transitions. Second operand 3 states. [2018-06-26 20:23:43,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:43,776 INFO ]: Finished difference Result 22 states and 335 transitions. [2018-06-26 20:23:43,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:43,776 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:23:43,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:43,777 INFO ]: With dead ends: 22 [2018-06-26 20:23:43,777 INFO ]: Without dead ends: 22 [2018-06-26 20:23:43,777 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:43,777 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 20:23:43,780 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-06-26 20:23:43,780 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 20:23:43,781 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 303 transitions. [2018-06-26 20:23:43,781 INFO ]: Start accepts. Automaton has 18 states and 303 transitions. Word has length 13 [2018-06-26 20:23:43,781 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:43,781 INFO ]: Abstraction has 18 states and 303 transitions. [2018-06-26 20:23:43,781 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:43,781 INFO ]: Start isEmpty. Operand 18 states and 303 transitions. [2018-06-26 20:23:43,781 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:23:43,782 INFO ]: Found error trace [2018-06-26 20:23:43,782 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:43,782 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:43,782 INFO ]: Analyzing trace with hash 1293383661, now seen corresponding path program 1 times [2018-06-26 20:23:43,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:43,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:43,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:43,782 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:43,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:43,816 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:43,938 INFO ]: Checked inductivity of 45 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-26 20:23:43,939 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:43,939 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:43,939 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:43,939 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:43,939 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:43,939 INFO ]: Start difference. First operand 18 states and 303 transitions. Second operand 3 states. [2018-06-26 20:23:44,251 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:44,251 INFO ]: Finished difference Result 23 states and 364 transitions. [2018-06-26 20:23:44,251 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:44,252 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 20:23:44,252 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:44,252 INFO ]: With dead ends: 23 [2018-06-26 20:23:44,252 INFO ]: Without dead ends: 23 [2018-06-26 20:23:44,253 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:23:44,253 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 20:23:44,255 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-26 20:23:44,255 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 20:23:44,258 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 332 transitions. [2018-06-26 20:23:44,258 INFO ]: Start accepts. Automaton has 19 states and 332 transitions. Word has length 14 [2018-06-26 20:23:44,258 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:44,258 INFO ]: Abstraction has 19 states and 332 transitions. [2018-06-26 20:23:44,258 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:44,258 INFO ]: Start isEmpty. Operand 19 states and 332 transitions. [2018-06-26 20:23:44,259 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 20:23:44,259 INFO ]: Found error trace [2018-06-26 20:23:44,259 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:44,259 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:44,259 INFO ]: Analyzing trace with hash -1402123374, now seen corresponding path program 1 times [2018-06-26 20:23:44,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:44,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:44,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:44,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:44,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:44,293 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:44,431 INFO ]: Checked inductivity of 55 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 20:23:44,431 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:44,431 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:44,431 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:44,431 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:44,431 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:44,431 INFO ]: Start difference. First operand 19 states and 332 transitions. Second operand 3 states. [2018-06-26 20:23:44,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:44,812 INFO ]: Finished difference Result 24 states and 391 transitions. [2018-06-26 20:23:44,815 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:44,815 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-26 20:23:44,815 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:44,816 INFO ]: With dead ends: 24 [2018-06-26 20:23:44,816 INFO ]: Without dead ends: 24 [2018-06-26 20:23:44,816 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:23:44,816 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 20:23:44,818 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-06-26 20:23:44,818 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 20:23:44,819 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 359 transitions. [2018-06-26 20:23:44,819 INFO ]: Start accepts. Automaton has 20 states and 359 transitions. Word has length 15 [2018-06-26 20:23:44,819 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:44,819 INFO ]: Abstraction has 20 states and 359 transitions. [2018-06-26 20:23:44,819 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:44,819 INFO ]: Start isEmpty. Operand 20 states and 359 transitions. [2018-06-26 20:23:44,820 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 20:23:44,820 INFO ]: Found error trace [2018-06-26 20:23:44,820 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:44,820 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:44,820 INFO ]: Analyzing trace with hash -2134824865, now seen corresponding path program 1 times [2018-06-26 20:23:44,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:44,820 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:44,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:44,821 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:44,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:44,858 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:44,912 INFO ]: Checked inductivity of 66 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-26 20:23:44,912 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:44,912 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:44,913 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:44,913 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:44,913 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:44,913 INFO ]: Start difference. First operand 20 states and 359 transitions. Second operand 3 states. [2018-06-26 20:23:45,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:45,072 INFO ]: Finished difference Result 25 states and 416 transitions. [2018-06-26 20:23:45,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:45,072 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-26 20:23:45,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:45,073 INFO ]: With dead ends: 25 [2018-06-26 20:23:45,073 INFO ]: Without dead ends: 25 [2018-06-26 20:23:45,073 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:23:45,073 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 20:23:45,076 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-26 20:23:45,076 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 20:23:45,077 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 384 transitions. [2018-06-26 20:23:45,077 INFO ]: Start accepts. Automaton has 21 states and 384 transitions. Word has length 16 [2018-06-26 20:23:45,077 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:45,077 INFO ]: Abstraction has 21 states and 384 transitions. [2018-06-26 20:23:45,077 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:45,077 INFO ]: Start isEmpty. Operand 21 states and 384 transitions. [2018-06-26 20:23:45,078 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:23:45,078 INFO ]: Found error trace [2018-06-26 20:23:45,078 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:45,078 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:45,078 INFO ]: Analyzing trace with hash -338575477, now seen corresponding path program 1 times [2018-06-26 20:23:45,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:45,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:45,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:45,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:45,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:45,090 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:45,150 INFO ]: Checked inductivity of 78 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 20:23:45,150 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:45,150 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:45,150 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:45,150 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:45,150 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:45,150 INFO ]: Start difference. First operand 21 states and 384 transitions. Second operand 3 states. [2018-06-26 20:23:45,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:45,441 INFO ]: Finished difference Result 22 states and 360 transitions. [2018-06-26 20:23:45,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:45,441 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:23:45,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:45,442 INFO ]: With dead ends: 22 [2018-06-26 20:23:45,442 INFO ]: Without dead ends: 21 [2018-06-26 20:23:45,442 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:23:45,442 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 20:23:45,446 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 20:23:45,446 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 20:23:45,447 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 349 transitions. [2018-06-26 20:23:45,447 INFO ]: Start accepts. Automaton has 21 states and 349 transitions. Word has length 17 [2018-06-26 20:23:45,447 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:45,447 INFO ]: Abstraction has 21 states and 349 transitions. [2018-06-26 20:23:45,447 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:45,447 INFO ]: Start isEmpty. Operand 21 states and 349 transitions. [2018-06-26 20:23:45,447 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:23:45,447 INFO ]: Found error trace [2018-06-26 20:23:45,448 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:45,448 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:45,448 INFO ]: Analyzing trace with hash -1228865235, now seen corresponding path program 1 times [2018-06-26 20:23:45,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:45,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:45,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:45,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:45,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:45,471 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:45,541 INFO ]: Checked inductivity of 78 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-26 20:23:45,541 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:45,541 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:45,541 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:45,541 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:45,541 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:45,541 INFO ]: Start difference. First operand 21 states and 349 transitions. Second operand 3 states. [2018-06-26 20:23:45,748 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:45,748 INFO ]: Finished difference Result 22 states and 365 transitions. [2018-06-26 20:23:45,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:45,748 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:23:45,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:45,749 INFO ]: With dead ends: 22 [2018-06-26 20:23:45,749 INFO ]: Without dead ends: 22 [2018-06-26 20:23:45,749 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:23:45,749 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 20:23:45,751 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 20:23:45,751 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 20:23:45,752 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 365 transitions. [2018-06-26 20:23:45,752 INFO ]: Start accepts. Automaton has 22 states and 365 transitions. Word has length 17 [2018-06-26 20:23:45,752 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:45,752 INFO ]: Abstraction has 22 states and 365 transitions. [2018-06-26 20:23:45,752 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:45,752 INFO ]: Start isEmpty. Operand 22 states and 365 transitions. [2018-06-26 20:23:45,753 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:23:45,753 INFO ]: Found error trace [2018-06-26 20:23:45,753 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:45,753 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:45,753 INFO ]: Analyzing trace with hash 1151288758, now seen corresponding path program 1 times [2018-06-26 20:23:45,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:45,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:45,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:45,754 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:45,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:45,777 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:45,850 INFO ]: Checked inductivity of 78 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-26 20:23:45,850 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:45,850 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:45,850 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:45,850 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:45,850 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:45,850 INFO ]: Start difference. First operand 22 states and 365 transitions. Second operand 3 states. [2018-06-26 20:23:46,074 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:46,074 INFO ]: Finished difference Result 23 states and 114 transitions. [2018-06-26 20:23:46,074 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:46,074 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:23:46,074 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:46,075 INFO ]: With dead ends: 23 [2018-06-26 20:23:46,075 INFO ]: Without dead ends: 22 [2018-06-26 20:23:46,075 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:23:46,075 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 20:23:46,077 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-26 20:23:46,077 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 20:23:46,077 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 99 transitions. [2018-06-26 20:23:46,077 INFO ]: Start accepts. Automaton has 21 states and 99 transitions. Word has length 17 [2018-06-26 20:23:46,077 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:46,077 INFO ]: Abstraction has 21 states and 99 transitions. [2018-06-26 20:23:46,077 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:46,077 INFO ]: Start isEmpty. Operand 21 states and 99 transitions. [2018-06-26 20:23:46,077 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:23:46,078 INFO ]: Found error trace [2018-06-26 20:23:46,078 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:23:46,078 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:46,078 INFO ]: Analyzing trace with hash -1552856474, now seen corresponding path program 1 times [2018-06-26 20:23:46,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:46,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:46,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:46,078 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:46,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:46,110 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:46,245 INFO ]: Checked inductivity of 91 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-26 20:23:46,245 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:46,245 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:46,245 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:46,245 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:46,245 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:46,246 INFO ]: Start difference. First operand 21 states and 99 transitions. Second operand 3 states. [2018-06-26 20:23:47,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:47,041 INFO ]: Finished difference Result 23 states and 139 transitions. [2018-06-26 20:23:47,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:47,042 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:23:47,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:47,042 INFO ]: With dead ends: 23 [2018-06-26 20:23:47,042 INFO ]: Without dead ends: 23 [2018-06-26 20:23:47,042 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:47,042 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 20:23:47,044 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-06-26 20:23:47,044 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 20:23:47,045 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2018-06-26 20:23:47,045 INFO ]: Start accepts. Automaton has 22 states and 123 transitions. Word has length 18 [2018-06-26 20:23:47,045 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:47,045 INFO ]: Abstraction has 22 states and 123 transitions. [2018-06-26 20:23:47,045 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:47,045 INFO ]: Start isEmpty. Operand 22 states and 123 transitions. [2018-06-26 20:23:47,045 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:23:47,045 INFO ]: Found error trace [2018-06-26 20:23:47,045 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:23:47,045 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:47,045 INFO ]: Analyzing trace with hash -140064312, now seen corresponding path program 1 times [2018-06-26 20:23:47,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:47,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:47,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:47,046 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:47,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:47,085 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:47,430 INFO ]: Checked inductivity of 91 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-26 20:23:47,430 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:23:47,430 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:23:47,444 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:47,716 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:47,739 INFO ]: Computing forward predicates... [2018-06-26 20:23:47,788 INFO ]: Checked inductivity of 91 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-26 20:23:47,823 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:23:47,823 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-06-26 20:23:47,824 INFO ]: Interpolant automaton has 5 states [2018-06-26 20:23:47,824 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 20:23:47,824 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 20:23:47,824 INFO ]: Start difference. First operand 22 states and 123 transitions. Second operand 5 states. [2018-06-26 20:23:49,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:49,705 INFO ]: Finished difference Result 39 states and 266 transitions. [2018-06-26 20:23:49,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 20:23:49,706 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-26 20:23:49,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:49,706 INFO ]: With dead ends: 39 [2018-06-26 20:23:49,706 INFO ]: Without dead ends: 39 [2018-06-26 20:23:49,707 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:23:49,707 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 20:23:49,710 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-06-26 20:23:49,710 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 20:23:49,718 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 206 transitions. [2018-06-26 20:23:49,718 INFO ]: Start accepts. Automaton has 35 states and 206 transitions. Word has length 18 [2018-06-26 20:23:49,719 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:49,719 INFO ]: Abstraction has 35 states and 206 transitions. [2018-06-26 20:23:49,719 INFO ]: Interpolant automaton has 5 states. [2018-06-26 20:23:49,719 INFO ]: Start isEmpty. Operand 35 states and 206 transitions. [2018-06-26 20:23:49,719 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:23:49,719 INFO ]: Found error trace [2018-06-26 20:23:49,719 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:23:49,719 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:49,719 INFO ]: Analyzing trace with hash 1299668032, now seen corresponding path program 1 times [2018-06-26 20:23:49,719 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:49,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:49,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:49,720 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:49,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:49,764 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:49,848 INFO ]: Checked inductivity of 91 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-26 20:23:49,879 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:49,879 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:49,879 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:49,879 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:49,879 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:49,879 INFO ]: Start difference. First operand 35 states and 206 transitions. Second operand 3 states. [2018-06-26 20:23:50,178 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:50,178 INFO ]: Finished difference Result 37 states and 228 transitions. [2018-06-26 20:23:50,178 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:50,178 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:23:50,178 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:50,179 INFO ]: With dead ends: 37 [2018-06-26 20:23:50,179 INFO ]: Without dead ends: 37 [2018-06-26 20:23:50,180 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:23:50,180 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 20:23:50,183 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-26 20:23:50,183 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 20:23:50,183 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 228 transitions. [2018-06-26 20:23:50,183 INFO ]: Start accepts. Automaton has 37 states and 228 transitions. Word has length 18 [2018-06-26 20:23:50,184 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:50,184 INFO ]: Abstraction has 37 states and 228 transitions. [2018-06-26 20:23:50,184 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:50,184 INFO ]: Start isEmpty. Operand 37 states and 228 transitions. [2018-06-26 20:23:50,184 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 20:23:50,184 INFO ]: Found error trace [2018-06-26 20:23:50,184 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:50,184 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:50,185 INFO ]: Analyzing trace with hash 1477854796, now seen corresponding path program 1 times [2018-06-26 20:23:50,185 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:50,185 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:50,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:50,186 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:50,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:50,224 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:50,706 INFO ]: Checked inductivity of 105 backedges. 63 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 20:23:50,706 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:23:50,706 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:23:50,721 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:23:50,981 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:50,997 INFO ]: Computing forward predicates... [2018-06-26 20:23:51,160 INFO ]: Checked inductivity of 105 backedges. 63 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-26 20:23:51,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:23:51,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-06-26 20:23:51,195 INFO ]: Interpolant automaton has 7 states [2018-06-26 20:23:51,195 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 20:23:51,195 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 20:23:51,195 INFO ]: Start difference. First operand 37 states and 228 transitions. Second operand 7 states. [2018-06-26 20:23:52,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:52,041 INFO ]: Finished difference Result 144 states and 1139 transitions. [2018-06-26 20:23:52,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 20:23:52,042 INFO ]: Start accepts. Automaton has 7 states. Word has length 19 [2018-06-26 20:23:52,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:52,043 INFO ]: With dead ends: 144 [2018-06-26 20:23:52,043 INFO ]: Without dead ends: 136 [2018-06-26 20:23:52,043 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-26 20:23:52,044 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-26 20:23:52,054 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 126. [2018-06-26 20:23:52,054 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-26 20:23:52,056 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 836 transitions. [2018-06-26 20:23:52,056 INFO ]: Start accepts. Automaton has 126 states and 836 transitions. Word has length 19 [2018-06-26 20:23:52,056 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:52,056 INFO ]: Abstraction has 126 states and 836 transitions. [2018-06-26 20:23:52,056 INFO ]: Interpolant automaton has 7 states. [2018-06-26 20:23:52,056 INFO ]: Start isEmpty. Operand 126 states and 836 transitions. [2018-06-26 20:23:52,058 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 20:23:52,058 INFO ]: Found error trace [2018-06-26 20:23:52,058 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:52,058 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:52,058 INFO ]: Analyzing trace with hash -1404320338, now seen corresponding path program 1 times [2018-06-26 20:23:52,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:52,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:52,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:52,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:52,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:52,091 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:52,183 INFO ]: Checked inductivity of 105 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-26 20:23:52,183 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:23:52,183 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:23:52,183 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:23:52,183 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:23:52,183 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:23:52,183 INFO ]: Start difference. First operand 126 states and 836 transitions. Second operand 3 states. [2018-06-26 20:23:52,349 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:23:52,349 INFO ]: Finished difference Result 134 states and 896 transitions. [2018-06-26 20:23:52,350 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:23:52,350 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-26 20:23:52,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:23:52,352 INFO ]: With dead ends: 134 [2018-06-26 20:23:52,352 INFO ]: Without dead ends: 134 [2018-06-26 20:23:52,352 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 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:23:52,352 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-26 20:23:52,366 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-06-26 20:23:52,366 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-26 20:23:52,368 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 896 transitions. [2018-06-26 20:23:52,368 INFO ]: Start accepts. Automaton has 134 states and 896 transitions. Word has length 19 [2018-06-26 20:23:52,368 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:23:52,368 INFO ]: Abstraction has 134 states and 896 transitions. [2018-06-26 20:23:52,368 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:23:52,368 INFO ]: Start isEmpty. Operand 134 states and 896 transitions. [2018-06-26 20:23:52,370 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 20:23:52,370 INFO ]: Found error trace [2018-06-26 20:23:52,370 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:23:52,370 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:23:52,370 INFO ]: Analyzing trace with hash -499508410, now seen corresponding path program 1 times [2018-06-26 20:23:52,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:23:52,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:23:52,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:52,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:52,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:23:52,412 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:52,968 INFO ]: Checked inductivity of 120 backedges. 69 proven. 24 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-26 20:23:52,968 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:23:52,968 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:23:53,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:23:53,324 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:23:53,334 INFO ]: Computing forward predicates... [2018-06-26 20:23:53,377 INFO ]: Checked inductivity of 120 backedges. 69 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-26 20:23:53,405 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:23:53,405 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-06-26 20:23:53,405 INFO ]: Interpolant automaton has 8 states [2018-06-26 20:23:53,405 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 20:23:53,405 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-26 20:23:53,405 INFO ]: Start difference. First operand 134 states and 896 transitions. Second operand 8 states. Received shutdown request... [2018-06-26 20:23:53,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 20:23:53,621 WARN ]: Verification canceled [2018-06-26 20:23:53,624 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:23:53,624 WARN ]: Timeout [2018-06-26 20:23:53,625 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:23:53 BasicIcfg [2018-06-26 20:23:53,625 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:23:53,625 INFO ]: Toolchain (without parser) took 61591.81 ms. Allocated memory was 309.3 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 248.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 546.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:23:53,627 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:23:53,627 INFO ]: ChcToBoogie took 74.32 ms. Allocated memory is still 309.3 MB. Free memory was 247.8 MB in the beginning and 244.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:23:53,627 INFO ]: Boogie Preprocessor took 53.10 ms. Allocated memory is still 309.3 MB. Free memory was 244.8 MB in the beginning and 243.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 20:23:53,627 INFO ]: RCFGBuilder took 435.79 ms. Allocated memory is still 309.3 MB. Free memory was 243.8 MB in the beginning and 218.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. [2018-06-26 20:23:53,628 INFO ]: BlockEncodingV2 took 22501.09 ms. Allocated memory was 309.3 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 218.7 MB in the beginning and 781.8 MB in the end (delta: -563.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 3.6 GB. [2018-06-26 20:23:53,628 INFO ]: TraceAbstraction took 38503.10 ms. Allocated memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 12.6 MB). Free memory was 781.8 MB in the beginning and 1.3 GB in the end (delta: -544.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:23:53,632 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, 7430 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 74.32 ms. Allocated memory is still 309.3 MB. Free memory was 247.8 MB in the beginning and 244.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 53.10 ms. Allocated memory is still 309.3 MB. Free memory was 244.8 MB in the beginning and 243.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 435.79 ms. Allocated memory is still 309.3 MB. Free memory was 243.8 MB in the beginning and 218.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 22501.09 ms. Allocated memory was 309.3 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 218.7 MB in the beginning and 781.8 MB in the end (delta: -563.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 3.6 GB. * TraceAbstraction took 38503.10 ms. Allocated memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 12.6 MB). Free memory was 781.8 MB in the beginning and 1.3 GB in the end (delta: -544.1 MB). There was no memory consumed. 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 constructing difference of abstraction (134states) and interpolant automaton (currently 5 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 38.4s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 32.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 2 SDslu, 111 SDs, 0 SdLazy, 3038 SolverSat, 15757 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 54 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 8339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6150 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 1343/1443 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/array_max-3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-23-53-642.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_max-3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-23-53-642.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_max-3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-23-53-642.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_max-3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-23-53-642.csv Completed graceful shutdown