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/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:13:48,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:13:48,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:13:48,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:13:48,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:13:48,495 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:13:48,496 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:13:48,500 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:13:48,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:13:48,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:13:48,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:13:48,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:13:48,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:13:48,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:13:48,509 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:13:48,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:13:48,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:13:48,512 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:13:48,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:13:48,515 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:13:48,516 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:13:48,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:13:48,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:13:48,522 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:13:48,522 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:13:48,523 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:13:48,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:13:48,524 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:13:48,532 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:13:48,533 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:13:48,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:13:48,534 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:13:48,534 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:13:48,534 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:13:48,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:13:48,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:13:48,536 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:13:48,550 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:13:48,550 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:13:48,550 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:13:48,550 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:13:48,551 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:13:48,552 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:13:48,552 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:13:48,552 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:13:48,552 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:13:48,552 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:13:48,553 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:13:48,553 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:13:48,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:13:48,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:13:48,553 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:13:48,554 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:13:48,554 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:13:48,554 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:13:48,554 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:13:48,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:13:48,554 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:13:48,556 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:13:48,556 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:13:48,608 INFO ]: Repository-Root is: /tmp [2018-06-26 18:13:48,625 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:13:48,631 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:13:48,632 INFO ]: Initializing SmtParser... [2018-06-26 18:13:48,633 INFO ]: SmtParser initialized [2018-06-26 18:13:48,633 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 [2018-06-26 18:13:48,634 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 18:13:48,722 INFO ]: Executing SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 unknown [2018-06-26 18:13:48,932 INFO ]: Succesfully executed SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 [2018-06-26 18:13:48,937 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:13:48,944 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:13:48,944 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:13:48,944 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:13:48,944 INFO ]: ChcToBoogie initialized [2018-06-26 18:13:48,949 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:13:48" (1/1) ... [2018-06-26 18:13:49,006 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:49 Unit [2018-06-26 18:13:49,006 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:13:49,006 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:13:49,006 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:13:49,006 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:13:49,027 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:49" (1/1) ... [2018-06-26 18:13:49,027 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:49" (1/1) ... [2018-06-26 18:13:49,034 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:49" (1/1) ... [2018-06-26 18:13:49,034 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:49" (1/1) ... [2018-06-26 18:13:49,038 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:49" (1/1) ... [2018-06-26 18:13:49,040 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:49" (1/1) ... [2018-06-26 18:13:49,050 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:49" (1/1) ... [2018-06-26 18:13:49,051 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:13:49,052 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:13:49,052 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:13:49,052 INFO ]: RCFGBuilder initialized [2018-06-26 18:13:49,053 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:49" (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 18:13:49,065 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:13:49,066 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:13:49,066 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:13:49,066 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:13:49,066 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:13:49,066 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 18:13:49,412 INFO ]: Using library mode [2018-06-26 18:13:49,412 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:13:49 BoogieIcfgContainer [2018-06-26 18:13:49,412 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:13:49,413 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:13:49,413 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:13:49,414 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:13:49,414 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:13:49" (1/1) ... [2018-06-26 18:13:49,431 INFO ]: Initial Icfg 23 locations, 32 edges [2018-06-26 18:13:49,432 INFO ]: Using Remove infeasible edges [2018-06-26 18:13:49,433 INFO ]: Using Maximize final states [2018-06-26 18:13:49,433 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:13:49,433 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:13:49,437 INFO ]: Using Remove sink states [2018-06-26 18:13:49,437 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:13:49,437 INFO ]: Using Use SBE [2018-06-26 18:13:49,443 INFO ]: SBE split 0 edges [2018-06-26 18:13:49,449 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:13:49,452 INFO ]: 0 new accepting states [2018-06-26 18:13:49,643 INFO ]: Removed 27 edges and 9 locations by large block encoding [2018-06-26 18:13:49,645 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:13:49,646 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:13:49,646 INFO ]: 0 new accepting states [2018-06-26 18:13:49,646 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:13:49,647 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:13:49,648 INFO ]: Encoded RCFG 12 locations, 22 edges [2018-06-26 18:13:49,648 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:13:49 BasicIcfg [2018-06-26 18:13:49,648 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:13:49,649 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:13:49,649 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:13:49,651 INFO ]: TraceAbstraction initialized [2018-06-26 18:13:49,651 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:13:48" (1/4) ... [2018-06-26 18:13:49,652 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:13:49, skipping insertion in model container [2018-06-26 18:13:49,652 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:49" (2/4) ... [2018-06-26 18:13:49,652 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:13:49, skipping insertion in model container [2018-06-26 18:13:49,652 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:13:49" (3/4) ... [2018-06-26 18:13:49,653 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:13:49, skipping insertion in model container [2018-06-26 18:13:49,653 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:13:49" (4/4) ... [2018-06-26 18:13:49,655 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:13:49,667 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:13:49,684 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:13:49,719 INFO ]: Using default assertion order modulation [2018-06-26 18:13:49,719 INFO ]: Interprodecural is true [2018-06-26 18:13:49,719 INFO ]: Hoare is false [2018-06-26 18:13:49,719 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:13:49,719 INFO ]: Backedges is TWOTRACK [2018-06-26 18:13:49,719 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:13:49,719 INFO ]: Difference is false [2018-06-26 18:13:49,719 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:13:49,719 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:13:49,728 INFO ]: Start isEmpty. Operand 12 states. [2018-06-26 18:13:49,740 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:13:49,740 INFO ]: Found error trace [2018-06-26 18:13:49,741 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:13:49,741 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:49,746 INFO ]: Analyzing trace with hash 37137809, now seen corresponding path program 1 times [2018-06-26 18:13:49,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:49,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:49,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:49,787 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:49,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:49,835 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:49,908 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:49,910 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:13:49,910 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:13:49,911 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:13:49,921 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:13:49,921 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:13:49,923 INFO ]: Start difference. First operand 12 states. Second operand 3 states. [2018-06-26 18:13:50,057 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:50,057 INFO ]: Finished difference Result 21 states and 40 transitions. [2018-06-26 18:13:50,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:13:50,058 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:13:50,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:50,067 INFO ]: With dead ends: 21 [2018-06-26 18:13:50,067 INFO ]: Without dead ends: 21 [2018-06-26 18:13:50,068 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 18:13:50,081 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 18:13:50,109 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 18:13:50,112 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 18:13:50,114 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 40 transitions. [2018-06-26 18:13:50,116 INFO ]: Start accepts. Automaton has 21 states and 40 transitions. Word has length 5 [2018-06-26 18:13:50,116 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:50,116 INFO ]: Abstraction has 21 states and 40 transitions. [2018-06-26 18:13:50,117 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:13:50,117 INFO ]: Start isEmpty. Operand 21 states and 40 transitions. [2018-06-26 18:13:50,118 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:13:50,118 INFO ]: Found error trace [2018-06-26 18:13:50,119 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:13:50,119 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:50,119 INFO ]: Analyzing trace with hash 37376137, now seen corresponding path program 1 times [2018-06-26 18:13:50,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:50,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:50,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:50,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:50,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:50,139 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:50,216 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:50,216 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:13:50,216 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:13:50,218 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:13:50,218 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:13:50,218 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:13:50,218 INFO ]: Start difference. First operand 21 states and 40 transitions. Second operand 3 states. [2018-06-26 18:13:50,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:50,453 INFO ]: Finished difference Result 37 states and 79 transitions. [2018-06-26 18:13:50,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:13:50,454 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:13:50,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:50,458 INFO ]: With dead ends: 37 [2018-06-26 18:13:50,458 INFO ]: Without dead ends: 37 [2018-06-26 18:13:50,459 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 18:13:50,459 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 18:13:50,467 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 23. [2018-06-26 18:13:50,467 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:13:50,469 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 50 transitions. [2018-06-26 18:13:50,469 INFO ]: Start accepts. Automaton has 23 states and 50 transitions. Word has length 5 [2018-06-26 18:13:50,469 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:50,469 INFO ]: Abstraction has 23 states and 50 transitions. [2018-06-26 18:13:50,469 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:13:50,469 INFO ]: Start isEmpty. Operand 23 states and 50 transitions. [2018-06-26 18:13:50,470 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:13:50,470 INFO ]: Found error trace [2018-06-26 18:13:50,470 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:13:50,470 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:50,470 INFO ]: Analyzing trace with hash 37377098, now seen corresponding path program 1 times [2018-06-26 18:13:50,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:50,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:50,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:50,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:50,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:50,494 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:50,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 18:13:50,556 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:13:50,556 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:13:50,556 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:13:50,557 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:13:50,557 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:13:50,557 INFO ]: Start difference. First operand 23 states and 50 transitions. Second operand 3 states. [2018-06-26 18:13:50,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:50,716 INFO ]: Finished difference Result 35 states and 68 transitions. [2018-06-26 18:13:50,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:13:50,720 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:13:50,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:50,721 INFO ]: With dead ends: 35 [2018-06-26 18:13:50,721 INFO ]: Without dead ends: 35 [2018-06-26 18:13:50,721 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 18:13:50,721 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:13:50,728 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-06-26 18:13:50,728 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:13:50,730 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2018-06-26 18:13:50,730 INFO ]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 5 [2018-06-26 18:13:50,730 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:50,730 INFO ]: Abstraction has 23 states and 48 transitions. [2018-06-26 18:13:50,730 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:13:50,730 INFO ]: Start isEmpty. Operand 23 states and 48 transitions. [2018-06-26 18:13:50,732 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:13:50,732 INFO ]: Found error trace [2018-06-26 18:13:50,732 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:13:50,732 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:50,732 INFO ]: Analyzing trace with hash 1152721386, now seen corresponding path program 1 times [2018-06-26 18:13:50,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:50,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:50,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:50,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:50,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:50,752 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:50,826 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:50,826 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:13:50,826 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:13:50,826 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:13:50,827 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:13:50,827 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:13:50,827 INFO ]: Start difference. First operand 23 states and 48 transitions. Second operand 3 states. [2018-06-26 18:13:50,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:50,959 INFO ]: Finished difference Result 33 states and 71 transitions. [2018-06-26 18:13:50,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:13:50,959 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:13:50,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:50,960 INFO ]: With dead ends: 33 [2018-06-26 18:13:50,960 INFO ]: Without dead ends: 33 [2018-06-26 18:13:50,961 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 18:13:50,961 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 18:13:50,967 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 18:13:50,967 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 18:13:50,968 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 71 transitions. [2018-06-26 18:13:50,968 INFO ]: Start accepts. Automaton has 33 states and 71 transitions. Word has length 6 [2018-06-26 18:13:50,968 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:50,968 INFO ]: Abstraction has 33 states and 71 transitions. [2018-06-26 18:13:50,968 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:13:50,968 INFO ]: Start isEmpty. Operand 33 states and 71 transitions. [2018-06-26 18:13:50,970 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:13:50,970 INFO ]: Found error trace [2018-06-26 18:13:50,970 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:50,970 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:50,970 INFO ]: Analyzing trace with hash 1026413702, now seen corresponding path program 1 times [2018-06-26 18:13:50,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:50,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:50,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:50,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:50,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:50,986 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:51,037 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:51,038 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:13:51,038 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:13:51,038 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:13:51,038 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:13:51,038 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:13:51,038 INFO ]: Start difference. First operand 33 states and 71 transitions. Second operand 4 states. [2018-06-26 18:13:51,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:51,177 INFO ]: Finished difference Result 81 states and 202 transitions. [2018-06-26 18:13:51,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:13:51,177 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-26 18:13:51,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:51,182 INFO ]: With dead ends: 81 [2018-06-26 18:13:51,182 INFO ]: Without dead ends: 81 [2018-06-26 18:13:51,182 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:13:51,183 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-26 18:13:51,200 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 45. [2018-06-26 18:13:51,200 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 18:13:51,202 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 89 transitions. [2018-06-26 18:13:51,202 INFO ]: Start accepts. Automaton has 45 states and 89 transitions. Word has length 8 [2018-06-26 18:13:51,202 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:51,202 INFO ]: Abstraction has 45 states and 89 transitions. [2018-06-26 18:13:51,202 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:13:51,202 INFO ]: Start isEmpty. Operand 45 states and 89 transitions. [2018-06-26 18:13:51,205 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:13:51,205 INFO ]: Found error trace [2018-06-26 18:13:51,205 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:51,205 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:51,205 INFO ]: Analyzing trace with hash 940526249, now seen corresponding path program 1 times [2018-06-26 18:13:51,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:51,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:51,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:51,206 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:51,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:51,226 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:51,375 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:13:51,375 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:13:51,375 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:13:51,375 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:13:51,375 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:13:51,375 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:13:51,376 INFO ]: Start difference. First operand 45 states and 89 transitions. Second operand 5 states. [2018-06-26 18:13:51,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:51,985 INFO ]: Finished difference Result 165 states and 437 transitions. [2018-06-26 18:13:51,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:13:51,986 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 18:13:51,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:51,997 INFO ]: With dead ends: 165 [2018-06-26 18:13:51,997 INFO ]: Without dead ends: 165 [2018-06-26 18:13:51,997 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:13:51,997 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-26 18:13:52,047 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 54. [2018-06-26 18:13:52,047 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-26 18:13:52,049 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 116 transitions. [2018-06-26 18:13:52,049 INFO ]: Start accepts. Automaton has 54 states and 116 transitions. Word has length 8 [2018-06-26 18:13:52,049 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:52,049 INFO ]: Abstraction has 54 states and 116 transitions. [2018-06-26 18:13:52,049 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:13:52,049 INFO ]: Start isEmpty. Operand 54 states and 116 transitions. [2018-06-26 18:13:52,052 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:13:52,052 INFO ]: Found error trace [2018-06-26 18:13:52,052 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:52,052 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:52,052 INFO ]: Analyzing trace with hash 940527210, now seen corresponding path program 1 times [2018-06-26 18:13:52,052 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:52,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:52,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:52,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:52,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:52,067 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:52,129 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:52,129 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:13:52,129 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:13:52,129 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:13:52,130 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:13:52,130 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:13:52,130 INFO ]: Start difference. First operand 54 states and 116 transitions. Second operand 4 states. [2018-06-26 18:13:52,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:52,190 INFO ]: Finished difference Result 82 states and 164 transitions. [2018-06-26 18:13:52,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:13:52,194 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-26 18:13:52,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:52,195 INFO ]: With dead ends: 82 [2018-06-26 18:13:52,195 INFO ]: Without dead ends: 67 [2018-06-26 18:13:52,195 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:13:52,195 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-26 18:13:52,202 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 48. [2018-06-26 18:13:52,202 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-26 18:13:52,203 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2018-06-26 18:13:52,203 INFO ]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 8 [2018-06-26 18:13:52,203 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:52,203 INFO ]: Abstraction has 48 states and 89 transitions. [2018-06-26 18:13:52,203 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:13:52,203 INFO ]: Start isEmpty. Operand 48 states and 89 transitions. [2018-06-26 18:13:52,205 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:13:52,205 INFO ]: Found error trace [2018-06-26 18:13:52,205 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:52,205 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:52,206 INFO ]: Analyzing trace with hash -491310876, now seen corresponding path program 1 times [2018-06-26 18:13:52,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:52,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:52,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:52,206 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:52,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:52,223 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:52,323 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:13:52,324 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:52,324 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 18:13:52,332 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:52,394 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:52,402 INFO ]: Computing forward predicates... [2018-06-26 18:13:52,852 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:13:52,871 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:52,871 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-26 18:13:52,871 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:13:52,871 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:13:52,872 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:13:52,872 INFO ]: Start difference. First operand 48 states and 89 transitions. Second operand 13 states. [2018-06-26 18:14:00,584 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:00,585 INFO ]: Finished difference Result 485 states and 2562 transitions. [2018-06-26 18:14:00,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-06-26 18:14:00,585 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-26 18:14:00,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:00,610 INFO ]: With dead ends: 485 [2018-06-26 18:14:00,610 INFO ]: Without dead ends: 354 [2018-06-26 18:14:00,614 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4565 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1433, Invalid=10777, Unknown=0, NotChecked=0, Total=12210 [2018-06-26 18:14:00,614 INFO ]: Start minimizeSevpa. Operand 354 states. [2018-06-26 18:14:00,894 INFO ]: Finished minimizeSevpa. Reduced states from 354 to 71. [2018-06-26 18:14:00,894 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-26 18:14:00,896 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 150 transitions. [2018-06-26 18:14:00,896 INFO ]: Start accepts. Automaton has 71 states and 150 transitions. Word has length 13 [2018-06-26 18:14:00,896 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:00,896 INFO ]: Abstraction has 71 states and 150 transitions. [2018-06-26 18:14:00,896 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:14:00,896 INFO ]: Start isEmpty. Operand 71 states and 150 transitions. [2018-06-26 18:14:00,898 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:14:00,898 INFO ]: Found error trace [2018-06-26 18:14:00,898 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:00,898 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:00,898 INFO ]: Analyzing trace with hash -462681725, now seen corresponding path program 1 times [2018-06-26 18:14:00,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:00,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:00,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:00,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:00,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:00,936 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:01,008 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:14:01,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:01,008 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:01,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:01,039 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:01,041 INFO ]: Computing forward predicates... [2018-06-26 18:14:01,047 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:14:01,066 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:01,067 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 18:14:01,067 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:14:01,067 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:14:01,067 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:14:01,067 INFO ]: Start difference. First operand 71 states and 150 transitions. Second operand 5 states. [2018-06-26 18:14:01,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:01,153 INFO ]: Finished difference Result 182 states and 370 transitions. [2018-06-26 18:14:01,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:14:01,153 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-26 18:14:01,154 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:01,157 INFO ]: With dead ends: 182 [2018-06-26 18:14:01,157 INFO ]: Without dead ends: 182 [2018-06-26 18:14:01,157 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:14:01,157 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-26 18:14:01,169 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 104. [2018-06-26 18:14:01,169 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-26 18:14:01,171 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 210 transitions. [2018-06-26 18:14:01,171 INFO ]: Start accepts. Automaton has 104 states and 210 transitions. Word has length 13 [2018-06-26 18:14:01,171 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:01,171 INFO ]: Abstraction has 104 states and 210 transitions. [2018-06-26 18:14:01,171 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:14:01,171 INFO ]: Start isEmpty. Operand 104 states and 210 transitions. [2018-06-26 18:14:01,174 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:14:01,174 INFO ]: Found error trace [2018-06-26 18:14:01,174 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:01,174 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:01,174 INFO ]: Analyzing trace with hash -462680764, now seen corresponding path program 1 times [2018-06-26 18:14:01,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:01,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:01,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:01,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:01,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:01,210 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:01,380 INFO ]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:14:01,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:01,380 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 18:14:01,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:01,413 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:01,416 INFO ]: Computing forward predicates... [2018-06-26 18:14:01,480 INFO ]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:14:01,499 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:01,500 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-26 18:14:01,500 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:14:01,500 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:14:01,500 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:14:01,500 INFO ]: Start difference. First operand 104 states and 210 transitions. Second operand 13 states. [2018-06-26 18:14:03,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:03,258 INFO ]: Finished difference Result 437 states and 1221 transitions. [2018-06-26 18:14:03,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 18:14:03,258 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-26 18:14:03,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:03,267 INFO ]: With dead ends: 437 [2018-06-26 18:14:03,268 INFO ]: Without dead ends: 437 [2018-06-26 18:14:03,268 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=321, Invalid=1085, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 18:14:03,268 INFO ]: Start minimizeSevpa. Operand 437 states. [2018-06-26 18:14:03,299 INFO ]: Finished minimizeSevpa. Reduced states from 437 to 191. [2018-06-26 18:14:03,299 INFO ]: Start removeUnreachable. Operand 191 states. [2018-06-26 18:14:03,302 INFO ]: Finished removeUnreachable. Reduced from 191 states to 191 states and 385 transitions. [2018-06-26 18:14:03,302 INFO ]: Start accepts. Automaton has 191 states and 385 transitions. Word has length 13 [2018-06-26 18:14:03,302 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:03,302 INFO ]: Abstraction has 191 states and 385 transitions. [2018-06-26 18:14:03,302 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:14:03,302 INFO ]: Start isEmpty. Operand 191 states and 385 transitions. [2018-06-26 18:14:03,305 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:14:03,305 INFO ]: Found error trace [2018-06-26 18:14:03,305 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:03,305 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:03,305 INFO ]: Analyzing trace with hash 1463877273, now seen corresponding path program 1 times [2018-06-26 18:14:03,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:03,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:03,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:03,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:03,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:03,314 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:03,368 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:14:03,368 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:14:03,368 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 18:14:03,368 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:14:03,368 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:14:03,369 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:14:03,369 INFO ]: Start difference. First operand 191 states and 385 transitions. Second operand 6 states. [2018-06-26 18:14:03,626 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:03,626 INFO ]: Finished difference Result 353 states and 994 transitions. [2018-06-26 18:14:03,626 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:14:03,626 INFO ]: Start accepts. Automaton has 6 states. Word has length 14 [2018-06-26 18:14:03,626 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:03,633 INFO ]: With dead ends: 353 [2018-06-26 18:14:03,634 INFO ]: Without dead ends: 353 [2018-06-26 18:14:03,634 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:14:03,634 INFO ]: Start minimizeSevpa. Operand 353 states. [2018-06-26 18:14:03,659 INFO ]: Finished minimizeSevpa. Reduced states from 353 to 214. [2018-06-26 18:14:03,659 INFO ]: Start removeUnreachable. Operand 214 states. [2018-06-26 18:14:03,665 INFO ]: Finished removeUnreachable. Reduced from 214 states to 214 states and 438 transitions. [2018-06-26 18:14:03,665 INFO ]: Start accepts. Automaton has 214 states and 438 transitions. Word has length 14 [2018-06-26 18:14:03,665 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:03,665 INFO ]: Abstraction has 214 states and 438 transitions. [2018-06-26 18:14:03,665 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:14:03,665 INFO ]: Start isEmpty. Operand 214 states and 438 transitions. [2018-06-26 18:14:03,671 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:14:03,671 INFO ]: Found error trace [2018-06-26 18:14:03,671 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:03,671 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:03,671 INFO ]: Analyzing trace with hash 1251606702, now seen corresponding path program 1 times [2018-06-26 18:14:03,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:03,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:03,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:03,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:03,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:03,689 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:03,770 INFO ]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:14:03,770 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:03,770 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:14:03,784 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:03,832 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:03,836 INFO ]: Computing forward predicates... [2018-06-26 18:14:04,166 INFO ]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 18:14:04,189 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:04,189 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-26 18:14:04,189 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:14:04,189 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:14:04,189 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:14:04,189 INFO ]: Start difference. First operand 214 states and 438 transitions. Second operand 15 states. [2018-06-26 18:14:04,631 WARN ]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-26 18:14:07,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:07,492 INFO ]: Finished difference Result 762 states and 2957 transitions. [2018-06-26 18:14:07,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-26 18:14:07,492 INFO ]: Start accepts. Automaton has 15 states. Word has length 19 [2018-06-26 18:14:07,493 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:07,524 INFO ]: With dead ends: 762 [2018-06-26 18:14:07,524 INFO ]: Without dead ends: 762 [2018-06-26 18:14:07,527 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=442, Invalid=2420, Unknown=0, NotChecked=0, Total=2862 [2018-06-26 18:14:07,527 INFO ]: Start minimizeSevpa. Operand 762 states. [2018-06-26 18:14:07,612 INFO ]: Finished minimizeSevpa. Reduced states from 762 to 376. [2018-06-26 18:14:07,612 INFO ]: Start removeUnreachable. Operand 376 states. [2018-06-26 18:14:07,622 INFO ]: Finished removeUnreachable. Reduced from 376 states to 376 states and 880 transitions. [2018-06-26 18:14:07,622 INFO ]: Start accepts. Automaton has 376 states and 880 transitions. Word has length 19 [2018-06-26 18:14:07,623 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:07,623 INFO ]: Abstraction has 376 states and 880 transitions. [2018-06-26 18:14:07,623 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:14:07,623 INFO ]: Start isEmpty. Operand 376 states and 880 transitions. [2018-06-26 18:14:07,631 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:14:07,631 INFO ]: Found error trace [2018-06-26 18:14:07,631 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:07,631 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:07,631 INFO ]: Analyzing trace with hash -336740239, now seen corresponding path program 1 times [2018-06-26 18:14:07,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:07,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:07,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:07,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:07,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:07,781 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:07,870 INFO ]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:14:07,871 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:14:07,871 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:14:07,871 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:14:07,871 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:14:07,871 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:14:07,871 INFO ]: Start difference. First operand 376 states and 880 transitions. Second operand 5 states. [2018-06-26 18:14:08,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:08,164 INFO ]: Finished difference Result 475 states and 1543 transitions. [2018-06-26 18:14:08,165 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:14:08,165 INFO ]: Start accepts. Automaton has 5 states. Word has length 19 [2018-06-26 18:14:08,165 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:08,182 INFO ]: With dead ends: 475 [2018-06-26 18:14:08,182 INFO ]: Without dead ends: 475 [2018-06-26 18:14:08,182 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:14:08,182 INFO ]: Start minimizeSevpa. Operand 475 states. [2018-06-26 18:14:08,215 INFO ]: Finished minimizeSevpa. Reduced states from 475 to 308. [2018-06-26 18:14:08,215 INFO ]: Start removeUnreachable. Operand 308 states. [2018-06-26 18:14:08,220 INFO ]: Finished removeUnreachable. Reduced from 308 states to 308 states and 695 transitions. [2018-06-26 18:14:08,221 INFO ]: Start accepts. Automaton has 308 states and 695 transitions. Word has length 19 [2018-06-26 18:14:08,221 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:08,221 INFO ]: Abstraction has 308 states and 695 transitions. [2018-06-26 18:14:08,221 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:14:08,221 INFO ]: Start isEmpty. Operand 308 states and 695 transitions. [2018-06-26 18:14:08,230 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:14:08,230 INFO ]: Found error trace [2018-06-26 18:14:08,230 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:08,230 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:08,230 INFO ]: Analyzing trace with hash 167590477, now seen corresponding path program 2 times [2018-06-26 18:14:08,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:08,231 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:08,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:08,231 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:08,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:08,247 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:08,313 INFO ]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:14:08,313 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:08,313 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:08,318 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:14:08,383 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:14:08,383 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:08,386 INFO ]: Computing forward predicates... [2018-06-26 18:14:08,574 INFO ]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:14:08,606 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:08,606 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-26 18:14:08,606 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:14:08,606 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:14:08,606 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:14:08,606 INFO ]: Start difference. First operand 308 states and 695 transitions. Second operand 14 states. [2018-06-26 18:14:10,485 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:10,485 INFO ]: Finished difference Result 510 states and 1773 transitions. [2018-06-26 18:14:10,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 18:14:10,485 INFO ]: Start accepts. Automaton has 14 states. Word has length 19 [2018-06-26 18:14:10,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:10,504 INFO ]: With dead ends: 510 [2018-06-26 18:14:10,504 INFO ]: Without dead ends: 510 [2018-06-26 18:14:10,504 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:14:10,504 INFO ]: Start minimizeSevpa. Operand 510 states. [2018-06-26 18:14:10,561 INFO ]: Finished minimizeSevpa. Reduced states from 510 to 319. [2018-06-26 18:14:10,561 INFO ]: Start removeUnreachable. Operand 319 states. [2018-06-26 18:14:10,569 INFO ]: Finished removeUnreachable. Reduced from 319 states to 319 states and 773 transitions. [2018-06-26 18:14:10,569 INFO ]: Start accepts. Automaton has 319 states and 773 transitions. Word has length 19 [2018-06-26 18:14:10,569 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:10,570 INFO ]: Abstraction has 319 states and 773 transitions. [2018-06-26 18:14:10,570 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:14:10,570 INFO ]: Start isEmpty. Operand 319 states and 773 transitions. [2018-06-26 18:14:10,600 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:14:10,600 INFO ]: Found error trace [2018-06-26 18:14:10,600 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:10,601 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:10,601 INFO ]: Analyzing trace with hash 1055094158, now seen corresponding path program 1 times [2018-06-26 18:14:10,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:10,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:10,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:10,602 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:14:10,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:10,621 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:10,919 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 18:14:11,506 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 18:14:11,762 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 18:14:11,764 INFO ]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:14:11,764 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:11,764 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:11,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:11,834 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:11,838 INFO ]: Computing forward predicates... [2018-06-26 18:14:11,928 INFO ]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:14:11,958 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:11,958 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-26 18:14:11,958 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:14:11,958 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:14:11,958 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:14:11,958 INFO ]: Start difference. First operand 319 states and 773 transitions. Second operand 14 states. [2018-06-26 18:14:12,714 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:12,714 INFO ]: Finished difference Result 511 states and 1676 transitions. [2018-06-26 18:14:12,714 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:14:12,714 INFO ]: Start accepts. Automaton has 14 states. Word has length 19 [2018-06-26 18:14:12,714 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:12,732 INFO ]: With dead ends: 511 [2018-06-26 18:14:12,732 INFO ]: Without dead ends: 511 [2018-06-26 18:14:12,732 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:14:12,732 INFO ]: Start minimizeSevpa. Operand 511 states. [2018-06-26 18:14:12,787 INFO ]: Finished minimizeSevpa. Reduced states from 511 to 321. [2018-06-26 18:14:12,787 INFO ]: Start removeUnreachable. Operand 321 states. [2018-06-26 18:14:12,792 INFO ]: Finished removeUnreachable. Reduced from 321 states to 321 states and 780 transitions. [2018-06-26 18:14:12,792 INFO ]: Start accepts. Automaton has 321 states and 780 transitions. Word has length 19 [2018-06-26 18:14:12,792 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:12,792 INFO ]: Abstraction has 321 states and 780 transitions. [2018-06-26 18:14:12,792 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:14:12,792 INFO ]: Start isEmpty. Operand 321 states and 780 transitions. [2018-06-26 18:14:12,801 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:14:12,801 INFO ]: Found error trace [2018-06-26 18:14:12,801 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:12,801 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:12,801 INFO ]: Analyzing trace with hash 1087758802, now seen corresponding path program 1 times [2018-06-26 18:14:12,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:12,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:12,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:12,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:12,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:12,813 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:12,882 INFO ]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:14:12,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:12,882 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:12,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:12,917 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:12,919 INFO ]: Computing forward predicates... [2018-06-26 18:14:12,960 INFO ]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:14:12,979 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:14:12,979 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-06-26 18:14:12,980 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:14:12,980 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:14:12,980 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:14:12,980 INFO ]: Start difference. First operand 321 states and 780 transitions. Second operand 9 states. [2018-06-26 18:14:13,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:13,400 INFO ]: Finished difference Result 487 states and 1373 transitions. [2018-06-26 18:14:13,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:14:13,401 INFO ]: Start accepts. Automaton has 9 states. Word has length 19 [2018-06-26 18:14:13,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:13,409 INFO ]: With dead ends: 487 [2018-06-26 18:14:13,409 INFO ]: Without dead ends: 456 [2018-06-26 18:14:13,410 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:14:13,410 INFO ]: Start minimizeSevpa. Operand 456 states. [2018-06-26 18:14:13,439 INFO ]: Finished minimizeSevpa. Reduced states from 456 to 302. [2018-06-26 18:14:13,439 INFO ]: Start removeUnreachable. Operand 302 states. [2018-06-26 18:14:13,443 INFO ]: Finished removeUnreachable. Reduced from 302 states to 302 states and 683 transitions. [2018-06-26 18:14:13,444 INFO ]: Start accepts. Automaton has 302 states and 683 transitions. Word has length 19 [2018-06-26 18:14:13,444 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:13,444 INFO ]: Abstraction has 302 states and 683 transitions. [2018-06-26 18:14:13,444 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:14:13,444 INFO ]: Start isEmpty. Operand 302 states and 683 transitions. [2018-06-26 18:14:13,449 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 18:14:13,449 INFO ]: Found error trace [2018-06-26 18:14:13,449 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-06-26 18:14:13,449 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:13,449 INFO ]: Analyzing trace with hash 84092169, now seen corresponding path program 2 times [2018-06-26 18:14:13,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:13,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:13,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:13,450 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:13,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:13,466 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:14,015 INFO ]: Checked inductivity of 20 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:14:14,015 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:14,015 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:14,020 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:14:14,057 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:14:14,057 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:14,060 INFO ]: Computing forward predicates... [2018-06-26 18:14:14,108 INFO ]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:14:14,126 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:14,127 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-06-26 18:14:14,127 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:14:14,127 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:14:14,127 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:14:14,127 INFO ]: Start difference. First operand 302 states and 683 transitions. Second operand 12 states. [2018-06-26 18:14:16,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:16,317 INFO ]: Finished difference Result 1182 states and 4095 transitions. [2018-06-26 18:14:16,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-06-26 18:14:16,318 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-26 18:14:16,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:16,388 INFO ]: With dead ends: 1182 [2018-06-26 18:14:16,388 INFO ]: Without dead ends: 1182 [2018-06-26 18:14:16,391 INFO ]: 0 DeclaredPredicates, 154 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2552 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1032, Invalid=6108, Unknown=0, NotChecked=0, Total=7140 [2018-06-26 18:14:16,392 INFO ]: Start minimizeSevpa. Operand 1182 states. [2018-06-26 18:14:16,507 INFO ]: Finished minimizeSevpa. Reduced states from 1182 to 441. [2018-06-26 18:14:16,507 INFO ]: Start removeUnreachable. Operand 441 states. [2018-06-26 18:14:16,515 INFO ]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1117 transitions. [2018-06-26 18:14:16,516 INFO ]: Start accepts. Automaton has 441 states and 1117 transitions. Word has length 21 [2018-06-26 18:14:16,516 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:16,516 INFO ]: Abstraction has 441 states and 1117 transitions. [2018-06-26 18:14:16,516 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:14:16,516 INFO ]: Start isEmpty. Operand 441 states and 1117 transitions. [2018-06-26 18:14:16,527 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 18:14:16,527 INFO ]: Found error trace [2018-06-26 18:14:16,527 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:16,527 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:16,527 INFO ]: Analyzing trace with hash -1492659232, now seen corresponding path program 1 times [2018-06-26 18:14:16,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:16,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:16,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:16,528 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:14:16,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:16,541 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:17,019 INFO ]: Checked inductivity of 33 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 18:14:17,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:17,019 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:17,035 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:17,080 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:17,083 INFO ]: Computing forward predicates... [2018-06-26 18:14:17,163 INFO ]: Checked inductivity of 33 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:14:17,195 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:17,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2018-06-26 18:14:17,195 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:14:17,195 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:14:17,195 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:14:17,196 INFO ]: Start difference. First operand 441 states and 1117 transitions. Second operand 14 states. [2018-06-26 18:14:18,361 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-06-26 18:14:23,907 WARN ]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-26 18:14:30,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:30,726 INFO ]: Finished difference Result 2754 states and 36479 transitions. [2018-06-26 18:14:30,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-06-26 18:14:30,726 INFO ]: Start accepts. Automaton has 14 states. Word has length 27 [2018-06-26 18:14:30,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:31,264 INFO ]: With dead ends: 2754 [2018-06-26 18:14:31,264 INFO ]: Without dead ends: 2754 [2018-06-26 18:14:31,268 INFO ]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8609 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2014, Invalid=19742, Unknown=0, NotChecked=0, Total=21756 [2018-06-26 18:14:31,269 INFO ]: Start minimizeSevpa. Operand 2754 states. [2018-06-26 18:14:34,518 INFO ]: Finished minimizeSevpa. Reduced states from 2754 to 673. [2018-06-26 18:14:34,518 INFO ]: Start removeUnreachable. Operand 673 states. [2018-06-26 18:14:34,537 INFO ]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1779 transitions. [2018-06-26 18:14:34,537 INFO ]: Start accepts. Automaton has 673 states and 1779 transitions. Word has length 27 [2018-06-26 18:14:34,538 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:34,538 INFO ]: Abstraction has 673 states and 1779 transitions. [2018-06-26 18:14:34,538 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:14:34,538 INFO ]: Start isEmpty. Operand 673 states and 1779 transitions. [2018-06-26 18:14:34,552 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 18:14:34,552 INFO ]: Found error trace [2018-06-26 18:14:34,552 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:34,552 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:34,552 INFO ]: Analyzing trace with hash 981659898, now seen corresponding path program 1 times [2018-06-26 18:14:34,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:34,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:34,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:34,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:34,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:34,566 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:35,817 INFO ]: Checked inductivity of 25 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:14:35,817 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:35,817 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:35,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:35,882 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:35,885 INFO ]: Computing forward predicates... [2018-06-26 18:14:36,132 INFO ]: Checked inductivity of 25 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:14:36,151 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:36,151 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-26 18:14:36,151 INFO ]: Interpolant automaton has 18 states [2018-06-26 18:14:36,151 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 18:14:36,151 INFO ]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:14:36,152 INFO ]: Start difference. First operand 673 states and 1779 transitions. Second operand 18 states. [2018-06-26 18:14:40,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:40,449 INFO ]: Finished difference Result 2613 states and 11590 transitions. [2018-06-26 18:14:40,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-26 18:14:40,449 INFO ]: Start accepts. Automaton has 18 states. Word has length 24 [2018-06-26 18:14:40,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:40,658 INFO ]: With dead ends: 2613 [2018-06-26 18:14:40,658 INFO ]: Without dead ends: 2212 [2018-06-26 18:14:40,659 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=664, Invalid=4306, Unknown=0, NotChecked=0, Total=4970 [2018-06-26 18:14:40,660 INFO ]: Start minimizeSevpa. Operand 2212 states. [2018-06-26 18:14:40,910 INFO ]: Finished minimizeSevpa. Reduced states from 2212 to 1116. [2018-06-26 18:14:40,910 INFO ]: Start removeUnreachable. Operand 1116 states. [2018-06-26 18:14:40,952 INFO ]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 2884 transitions. [2018-06-26 18:14:40,952 INFO ]: Start accepts. Automaton has 1116 states and 2884 transitions. Word has length 24 [2018-06-26 18:14:40,952 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:40,952 INFO ]: Abstraction has 1116 states and 2884 transitions. [2018-06-26 18:14:40,952 INFO ]: Interpolant automaton has 18 states. [2018-06-26 18:14:40,952 INFO ]: Start isEmpty. Operand 1116 states and 2884 transitions. [2018-06-26 18:14:40,967 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 18:14:40,967 INFO ]: Found error trace [2018-06-26 18:14:40,967 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:40,967 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:40,967 INFO ]: Analyzing trace with hash 981660859, now seen corresponding path program 2 times [2018-06-26 18:14:40,967 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:40,967 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:40,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:40,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:14:40,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:40,984 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:41,623 INFO ]: Checked inductivity of 25 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:14:41,623 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:41,623 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:41,629 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:14:41,666 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:14:41,666 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:41,669 INFO ]: Computing forward predicates... [2018-06-26 18:14:41,702 INFO ]: Checked inductivity of 25 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 18:14:41,734 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:41,734 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 18:14:41,735 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:14:41,735 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:14:41,735 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:14:41,735 INFO ]: Start difference. First operand 1116 states and 2884 transitions. Second operand 8 states. [2018-06-26 18:14:42,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:42,121 INFO ]: Finished difference Result 1341 states and 3967 transitions. [2018-06-26 18:14:42,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:14:42,121 INFO ]: Start accepts. Automaton has 8 states. Word has length 24 [2018-06-26 18:14:42,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:42,168 INFO ]: With dead ends: 1341 [2018-06-26 18:14:42,168 INFO ]: Without dead ends: 1341 [2018-06-26 18:14:42,168 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:14:42,168 INFO ]: Start minimizeSevpa. Operand 1341 states. [2018-06-26 18:14:42,258 INFO ]: Finished minimizeSevpa. Reduced states from 1341 to 1112. [2018-06-26 18:14:42,258 INFO ]: Start removeUnreachable. Operand 1112 states. [2018-06-26 18:14:42,299 INFO ]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 2876 transitions. [2018-06-26 18:14:42,299 INFO ]: Start accepts. Automaton has 1112 states and 2876 transitions. Word has length 24 [2018-06-26 18:14:42,299 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:42,299 INFO ]: Abstraction has 1112 states and 2876 transitions. [2018-06-26 18:14:42,299 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:14:42,299 INFO ]: Start isEmpty. Operand 1112 states and 2876 transitions. [2018-06-26 18:14:42,316 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 18:14:42,316 INFO ]: Found error trace [2018-06-26 18:14:42,316 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:42,316 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:42,316 INFO ]: Analyzing trace with hash -1805755589, now seen corresponding path program 3 times [2018-06-26 18:14:42,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:42,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:42,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:42,317 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:14:42,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:42,336 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:42,469 INFO ]: Checked inductivity of 25 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 18:14:42,469 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:42,469 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:42,475 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:14:42,510 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:14:42,510 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:42,513 INFO ]: Computing forward predicates... [2018-06-26 18:14:42,751 INFO ]: Checked inductivity of 25 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 18:14:42,770 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:42,770 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2018-06-26 18:14:42,770 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:14:42,770 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:14:42,771 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:14:42,771 INFO ]: Start difference. First operand 1112 states and 2876 transitions. Second operand 14 states. [2018-06-26 18:14:43,618 WARN ]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 30 Received shutdown request... [2018-06-26 18:14:44,730 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-26 18:14:44,730 WARN ]: Verification canceled [2018-06-26 18:14:44,733 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:14:44,734 WARN ]: Timeout [2018-06-26 18:14:44,734 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:14:44 BasicIcfg [2018-06-26 18:14:44,734 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:14:44,735 INFO ]: Toolchain (without parser) took 55797.65 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 950.5 MB). Free memory was 263.6 MB in the beginning and 811.7 MB in the end (delta: -548.1 MB). Peak memory consumption was 402.5 MB. Max. memory is 3.6 GB. [2018-06-26 18:14:44,736 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:14:44,736 INFO ]: ChcToBoogie took 61.76 ms. Allocated memory is still 309.3 MB. Free memory was 262.6 MB in the beginning and 260.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:14:44,736 INFO ]: Boogie Preprocessor took 45.11 ms. Allocated memory is still 309.3 MB. Free memory was 260.6 MB in the beginning and 259.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 18:14:44,737 INFO ]: RCFGBuilder took 360.08 ms. Allocated memory is still 309.3 MB. Free memory was 259.6 MB in the beginning and 245.6 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:14:44,737 INFO ]: BlockEncodingV2 took 235.75 ms. Allocated memory is still 309.3 MB. Free memory was 245.6 MB in the beginning and 234.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:14:44,737 INFO ]: TraceAbstraction took 55085.26 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 950.5 MB). Free memory was 233.6 MB in the beginning and 811.7 MB in the end (delta: -578.1 MB). Peak memory consumption was 372.4 MB. Max. memory is 3.6 GB. [2018-06-26 18:14:44,739 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 23 locations, 32 edges - StatisticsResult: Encoded RCFG 12 locations, 22 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.76 ms. Allocated memory is still 309.3 MB. Free memory was 262.6 MB in the beginning and 260.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.11 ms. Allocated memory is still 309.3 MB. Free memory was 260.6 MB in the beginning and 259.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 360.08 ms. Allocated memory is still 309.3 MB. Free memory was 259.6 MB in the beginning and 245.6 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 235.75 ms. Allocated memory is still 309.3 MB. Free memory was 245.6 MB in the beginning and 234.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55085.26 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 950.5 MB). Free memory was 233.6 MB in the beginning and 811.7 MB in the end (delta: -578.1 MB). Peak memory consumption was 372.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (1112states) and interpolant automaton (currently 48 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (2170 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. TIMEOUT Result, 55.0s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 41.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2452 SDtfs, 2237 SDslu, 8189 SDs, 0 SdLazy, 26578 SolverSat, 6520 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1040 GetRequests, 367 SyntacticMatches, 8 SemanticMatches, 665 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 19267 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1116occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 6173 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 548 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 515 ConstructedInterpolants, 30 QuantifiedInterpolants, 39009 SizeOfPredicates, 261 NumberOfNonLiveVariables, 3890 ConjunctsInSsa, 425 ConjunctsInUnsatCore, 33 InterpolantComputations, 10 PerfectInterpolantSequences, 312/412 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_reverse_once1_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-14-44-749.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_reverse_once1_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-14-44-749.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_reverse_once1_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-14-44-749.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_reverse_once1_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-14-44-749.csv Completed graceful shutdown