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/eldarica-misc/LIA/Consistency/graham-scan-full.32.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:30:17,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:30:17,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:30:17,021 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:30:17,022 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:30:17,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:30:17,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:30:17,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:30:17,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:30:17,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:30:17,036 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:30:17,036 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:30:17,037 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:30:17,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:30:17,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:30:17,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:30:17,042 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:30:17,044 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:30:17,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:30:17,059 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:30:17,060 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:30:17,061 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:30:17,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:30:17,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:30:17,064 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:30:17,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:30:17,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:30:17,071 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:30:17,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:30:17,073 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:30:17,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:30:17,074 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:30:17,074 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:30:17,074 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:30:17,075 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:30:17,075 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:30:17,080 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:30:17,104 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:30:17,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:30:17,105 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:30:17,105 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:30:17,110 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:30:17,110 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:30:17,110 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:30:17,111 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:30:17,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:30:17,111 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:30:17,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:30:17,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:30:17,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:30:17,112 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:30:17,112 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:30:17,112 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:30:17,112 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:30:17,112 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:30:17,113 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:30:17,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:30:17,113 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:30:17,116 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:30:17,116 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:30:17,167 INFO ]: Repository-Root is: /tmp [2018-06-26 17:30:17,184 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:30:17,187 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:30:17,189 INFO ]: Initializing SmtParser... [2018-06-26 17:30:17,189 INFO ]: SmtParser initialized [2018-06-26 17:30:17,190 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/graham-scan-full.32.smt2 [2018-06-26 17:30:17,191 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 17:30:17,273 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/graham-scan-full.32.smt2 unknown [2018-06-26 17:30:17,708 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/graham-scan-full.32.smt2 [2018-06-26 17:30:17,719 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:30:17,726 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:30:17,727 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:30:17,727 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:30:17,727 INFO ]: ChcToBoogie initialized [2018-06-26 17:30:17,730 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:30:17" (1/1) ... [2018-06-26 17:30:17,826 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:30:17 Unit [2018-06-26 17:30:17,826 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:30:17,827 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:30:17,827 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:30:17,827 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:30:17,848 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:30:17" (1/1) ... [2018-06-26 17:30:17,848 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:30:17" (1/1) ... [2018-06-26 17:30:17,870 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:30:17" (1/1) ... [2018-06-26 17:30:17,870 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:30:17" (1/1) ... [2018-06-26 17:30:17,899 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:30:17" (1/1) ... [2018-06-26 17:30:17,903 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:30:17" (1/1) ... [2018-06-26 17:30:17,919 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:30:17" (1/1) ... [2018-06-26 17:30:17,924 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:30:17,924 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:30:17,924 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:30:17,924 INFO ]: RCFGBuilder initialized [2018-06-26 17:30:17,925 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:30:17" (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 17:30:17,955 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:30:17,955 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:30:17,955 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:30:17,955 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:30:17,955 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:30:17,955 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 17:30:19,370 INFO ]: Using library mode [2018-06-26 17:30:19,371 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:30:19 BoogieIcfgContainer [2018-06-26 17:30:19,371 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:30:19,371 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:30:19,371 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:30:19,372 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:30:19,373 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:30:19" (1/1) ... [2018-06-26 17:30:19,422 INFO ]: Initial Icfg 145 locations, 279 edges [2018-06-26 17:30:19,423 INFO ]: Using Remove infeasible edges [2018-06-26 17:30:19,423 INFO ]: Using Maximize final states [2018-06-26 17:30:19,424 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:30:19,424 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:30:19,427 INFO ]: Using Remove sink states [2018-06-26 17:30:19,428 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:30:19,428 INFO ]: Using Use SBE [2018-06-26 17:30:19,441 INFO ]: SBE split 0 edges [2018-06-26 17:30:19,446 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 17:30:19,448 INFO ]: 0 new accepting states [2018-06-26 17:30:20,103 INFO ]: Removed 49 edges and 7 locations by large block encoding [2018-06-26 17:30:20,107 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-26 17:30:20,112 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:30:20,113 INFO ]: 0 new accepting states [2018-06-26 17:30:20,116 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:30:20,116 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:30:20,118 INFO ]: Encoded RCFG 135 locations, 268 edges [2018-06-26 17:30:20,119 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:30:20 BasicIcfg [2018-06-26 17:30:20,119 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:30:20,120 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:30:20,120 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:30:20,123 INFO ]: TraceAbstraction initialized [2018-06-26 17:30:20,123 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:30:17" (1/4) ... [2018-06-26 17:30:20,124 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2de470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:30:20, skipping insertion in model container [2018-06-26 17:30:20,124 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:30:17" (2/4) ... [2018-06-26 17:30:20,124 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2de470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:30:20, skipping insertion in model container [2018-06-26 17:30:20,124 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:30:19" (3/4) ... [2018-06-26 17:30:20,125 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2de470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:30:20, skipping insertion in model container [2018-06-26 17:30:20,125 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:30:20" (4/4) ... [2018-06-26 17:30:20,127 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:30:20,136 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:30:20,144 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:30:20,187 INFO ]: Using default assertion order modulation [2018-06-26 17:30:20,187 INFO ]: Interprodecural is true [2018-06-26 17:30:20,187 INFO ]: Hoare is false [2018-06-26 17:30:20,187 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:30:20,188 INFO ]: Backedges is TWOTRACK [2018-06-26 17:30:20,188 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:30:20,188 INFO ]: Difference is false [2018-06-26 17:30:20,188 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:30:20,188 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:30:20,209 INFO ]: Start isEmpty. Operand 135 states. [2018-06-26 17:30:20,282 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:30:20,282 INFO ]: Found error trace [2018-06-26 17:30:20,283 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:30:20,284 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:30:20,289 INFO ]: Analyzing trace with hash 174854987, now seen corresponding path program 1 times [2018-06-26 17:30:20,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:30:20,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:30:20,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:20,330 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:30:20,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:20,428 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:30:20,628 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:30:20,630 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:30:20,630 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:30:20,632 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:30:20,647 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:30:20,648 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:30:20,651 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-26 17:30:22,502 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:30:22,503 INFO ]: Finished difference Result 267 states and 532 transitions. [2018-06-26 17:30:22,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:30:22,505 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:30:22,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:30:22,579 INFO ]: With dead ends: 267 [2018-06-26 17:30:22,579 INFO ]: Without dead ends: 267 [2018-06-26 17:30:22,581 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 17:30:22,602 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-26 17:30:22,756 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-26 17:30:22,757 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-26 17:30:22,778 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 532 transitions. [2018-06-26 17:30:22,780 INFO ]: Start accepts. Automaton has 267 states and 532 transitions. Word has length 5 [2018-06-26 17:30:22,781 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:30:22,781 INFO ]: Abstraction has 267 states and 532 transitions. [2018-06-26 17:30:22,781 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:30:22,781 INFO ]: Start isEmpty. Operand 267 states and 532 transitions. [2018-06-26 17:30:22,794 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:30:22,794 INFO ]: Found error trace [2018-06-26 17:30:22,794 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:30:22,794 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:30:22,794 INFO ]: Analyzing trace with hash 174948204, now seen corresponding path program 1 times [2018-06-26 17:30:22,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:30:22,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:30:22,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:22,795 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:30:22,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:22,821 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:30:22,930 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:30:22,931 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:30:22,931 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:30:22,932 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:30:22,932 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:30:22,932 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:30:22,932 INFO ]: Start difference. First operand 267 states and 532 transitions. Second operand 3 states. [2018-06-26 17:30:24,559 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:30:24,569 INFO ]: Finished difference Result 399 states and 797 transitions. [2018-06-26 17:30:24,570 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:30:24,570 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:30:24,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:30:24,597 INFO ]: With dead ends: 399 [2018-06-26 17:30:24,597 INFO ]: Without dead ends: 399 [2018-06-26 17:30:24,598 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 17:30:24,599 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-26 17:30:24,678 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-26 17:30:24,678 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-26 17:30:24,700 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 797 transitions. [2018-06-26 17:30:24,700 INFO ]: Start accepts. Automaton has 399 states and 797 transitions. Word has length 5 [2018-06-26 17:30:24,700 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:30:24,700 INFO ]: Abstraction has 399 states and 797 transitions. [2018-06-26 17:30:24,700 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:30:24,700 INFO ]: Start isEmpty. Operand 399 states and 797 transitions. [2018-06-26 17:30:24,766 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:30:24,766 INFO ]: Found error trace [2018-06-26 17:30:24,766 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:30:24,766 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:30:24,766 INFO ]: Analyzing trace with hash -1612125936, now seen corresponding path program 1 times [2018-06-26 17:30:24,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:30:24,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:30:24,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:24,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:30:24,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:24,822 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:30:25,166 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:30:25,166 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:30:25,166 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:30:25,166 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:30:25,167 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:30:25,167 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:30:25,167 INFO ]: Start difference. First operand 399 states and 797 transitions. Second operand 5 states. [2018-06-26 17:30:28,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:30:28,244 INFO ]: Finished difference Result 840 states and 2114 transitions. [2018-06-26 17:30:28,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:30:28,246 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:30:28,246 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:30:28,435 INFO ]: With dead ends: 840 [2018-06-26 17:30:28,435 INFO ]: Without dead ends: 739 [2018-06-26 17:30:28,437 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:30:28,438 INFO ]: Start minimizeSevpa. Operand 739 states. [2018-06-26 17:30:28,669 INFO ]: Finished minimizeSevpa. Reduced states from 739 to 611. [2018-06-26 17:30:28,669 INFO ]: Start removeUnreachable. Operand 611 states. [2018-06-26 17:30:28,784 INFO ]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1339 transitions. [2018-06-26 17:30:28,784 INFO ]: Start accepts. Automaton has 611 states and 1339 transitions. Word has length 9 [2018-06-26 17:30:28,784 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:30:28,784 INFO ]: Abstraction has 611 states and 1339 transitions. [2018-06-26 17:30:28,784 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:30:28,784 INFO ]: Start isEmpty. Operand 611 states and 1339 transitions. [2018-06-26 17:30:28,811 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:30:28,811 INFO ]: Found error trace [2018-06-26 17:30:28,811 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:30:28,811 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:30:28,811 INFO ]: Analyzing trace with hash 345154702, now seen corresponding path program 1 times [2018-06-26 17:30:28,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:30:28,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:30:28,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:28,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:30:28,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:28,863 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:30:29,106 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:30:29,107 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:30:29,107 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:30:29,107 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:30:29,107 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:30:29,107 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:30:29,107 INFO ]: Start difference. First operand 611 states and 1339 transitions. Second operand 5 states. [2018-06-26 17:30:33,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:30:33,115 INFO ]: Finished difference Result 1379 states and 4383 transitions. [2018-06-26 17:30:33,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:30:33,115 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:30:33,115 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:30:33,345 INFO ]: With dead ends: 1379 [2018-06-26 17:30:33,345 INFO ]: Without dead ends: 1373 [2018-06-26 17:30:33,346 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:30:33,346 INFO ]: Start minimizeSevpa. Operand 1373 states. [2018-06-26 17:30:33,604 INFO ]: Finished minimizeSevpa. Reduced states from 1373 to 973. [2018-06-26 17:30:33,604 INFO ]: Start removeUnreachable. Operand 973 states. [2018-06-26 17:30:33,657 INFO ]: Finished removeUnreachable. Reduced from 973 states to 973 states and 2660 transitions. [2018-06-26 17:30:33,657 INFO ]: Start accepts. Automaton has 973 states and 2660 transitions. Word has length 9 [2018-06-26 17:30:33,657 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:30:33,657 INFO ]: Abstraction has 973 states and 2660 transitions. [2018-06-26 17:30:33,657 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:30:33,657 INFO ]: Start isEmpty. Operand 973 states and 2660 transitions. [2018-06-26 17:30:33,690 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:30:33,690 INFO ]: Found error trace [2018-06-26 17:30:33,691 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:30:33,691 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:30:33,691 INFO ]: Analyzing trace with hash 342384139, now seen corresponding path program 1 times [2018-06-26 17:30:33,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:30:33,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:30:33,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:33,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:30:33,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:33,719 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:30:33,980 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:30:33,981 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:30:33,981 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:30:33,981 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:30:33,981 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:30:33,981 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:30:33,981 INFO ]: Start difference. First operand 973 states and 2660 transitions. Second operand 5 states. [2018-06-26 17:30:37,690 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:30:37,690 INFO ]: Finished difference Result 1804 states and 6699 transitions. [2018-06-26 17:30:37,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:30:37,690 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:30:37,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:30:37,821 INFO ]: With dead ends: 1804 [2018-06-26 17:30:37,821 INFO ]: Without dead ends: 1646 [2018-06-26 17:30:37,821 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:30:37,822 INFO ]: Start minimizeSevpa. Operand 1646 states. [2018-06-26 17:30:38,307 INFO ]: Finished minimizeSevpa. Reduced states from 1646 to 1151. [2018-06-26 17:30:38,314 INFO ]: Start removeUnreachable. Operand 1151 states. [2018-06-26 17:30:38,368 INFO ]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 3756 transitions. [2018-06-26 17:30:38,368 INFO ]: Start accepts. Automaton has 1151 states and 3756 transitions. Word has length 9 [2018-06-26 17:30:38,369 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:30:38,369 INFO ]: Abstraction has 1151 states and 3756 transitions. [2018-06-26 17:30:38,369 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:30:38,369 INFO ]: Start isEmpty. Operand 1151 states and 3756 transitions. [2018-06-26 17:30:38,403 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:30:38,403 INFO ]: Found error trace [2018-06-26 17:30:38,403 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:30:38,403 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:30:38,403 INFO ]: Analyzing trace with hash -768965658, now seen corresponding path program 1 times [2018-06-26 17:30:38,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:30:38,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:30:38,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:38,405 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:30:38,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:38,435 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:30:38,727 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:30:38,727 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:30:38,727 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:30:38,727 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:30:38,727 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:30:38,727 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:30:38,727 INFO ]: Start difference. First operand 1151 states and 3756 transitions. Second operand 6 states. [2018-06-26 17:30:42,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:30:42,961 INFO ]: Finished difference Result 2073 states and 9141 transitions. [2018-06-26 17:30:42,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:30:42,962 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:30:42,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:30:43,146 INFO ]: With dead ends: 2073 [2018-06-26 17:30:43,147 INFO ]: Without dead ends: 2073 [2018-06-26 17:30:43,147 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:30:43,148 INFO ]: Start minimizeSevpa. Operand 2073 states. [2018-06-26 17:30:43,828 INFO ]: Finished minimizeSevpa. Reduced states from 2073 to 1305. [2018-06-26 17:30:43,828 INFO ]: Start removeUnreachable. Operand 1305 states. [2018-06-26 17:30:43,944 INFO ]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 4260 transitions. [2018-06-26 17:30:43,945 INFO ]: Start accepts. Automaton has 1305 states and 4260 transitions. Word has length 10 [2018-06-26 17:30:43,945 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:30:43,945 INFO ]: Abstraction has 1305 states and 4260 transitions. [2018-06-26 17:30:43,945 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:30:43,945 INFO ]: Start isEmpty. Operand 1305 states and 4260 transitions. [2018-06-26 17:30:43,974 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:30:43,974 INFO ]: Found error trace [2018-06-26 17:30:43,974 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:30:43,974 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:30:43,975 INFO ]: Analyzing trace with hash -854853111, now seen corresponding path program 1 times [2018-06-26 17:30:43,975 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:30:43,975 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:30:43,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:43,976 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:30:43,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:43,992 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:30:44,371 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:30:44,372 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:30:44,372 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:30:44,372 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:30:44,372 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:30:44,372 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:30:44,372 INFO ]: Start difference. First operand 1305 states and 4260 transitions. Second operand 6 states. [2018-06-26 17:30:49,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:30:49,592 INFO ]: Finished difference Result 3297 states and 15223 transitions. [2018-06-26 17:30:49,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:30:49,738 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:30:49,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:30:50,127 INFO ]: With dead ends: 3297 [2018-06-26 17:30:50,127 INFO ]: Without dead ends: 3297 [2018-06-26 17:30:50,128 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:30:50,129 INFO ]: Start minimizeSevpa. Operand 3297 states. [2018-06-26 17:30:51,046 INFO ]: Finished minimizeSevpa. Reduced states from 3297 to 1948. [2018-06-26 17:30:51,046 INFO ]: Start removeUnreachable. Operand 1948 states. [2018-06-26 17:30:51,159 INFO ]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 6378 transitions. [2018-06-26 17:30:51,159 INFO ]: Start accepts. Automaton has 1948 states and 6378 transitions. Word has length 10 [2018-06-26 17:30:51,159 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:30:51,159 INFO ]: Abstraction has 1948 states and 6378 transitions. [2018-06-26 17:30:51,159 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:30:51,159 INFO ]: Start isEmpty. Operand 1948 states and 6378 transitions. [2018-06-26 17:30:51,181 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:30:51,181 INFO ]: Found error trace [2018-06-26 17:30:51,181 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:30:51,181 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:30:51,182 INFO ]: Analyzing trace with hash -1197524881, now seen corresponding path program 1 times [2018-06-26 17:30:51,182 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:30:51,182 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:30:51,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:51,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:30:51,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:30:51,203 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:30:51,401 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:30:51,401 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:30:51,401 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 17:30:51,407 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:30:51,460 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:30:51,469 INFO ]: Computing forward predicates... [2018-06-26 17:30:51,678 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:30:51,713 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:30:51,713 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-26 17:30:51,713 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:30:51,713 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:30:51,713 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:30:51,713 INFO ]: Start difference. First operand 1948 states and 6378 transitions. Second operand 8 states. [2018-06-26 17:30:59,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:30:59,596 INFO ]: Finished difference Result 4173 states and 20150 transitions. [2018-06-26 17:30:59,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:30:59,597 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-26 17:30:59,597 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:31:00,428 INFO ]: With dead ends: 4173 [2018-06-26 17:31:00,428 INFO ]: Without dead ends: 3695 [2018-06-26 17:31:00,428 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:31:00,430 INFO ]: Start minimizeSevpa. Operand 3695 states. [2018-06-26 17:31:02,041 INFO ]: Finished minimizeSevpa. Reduced states from 3695 to 2894. [2018-06-26 17:31:02,041 INFO ]: Start removeUnreachable. Operand 2894 states. [2018-06-26 17:31:02,314 INFO ]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 10120 transitions. [2018-06-26 17:31:02,314 INFO ]: Start accepts. Automaton has 2894 states and 10120 transitions. Word has length 10 [2018-06-26 17:31:02,315 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:31:02,315 INFO ]: Abstraction has 2894 states and 10120 transitions. [2018-06-26 17:31:02,315 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:31:02,315 INFO ]: Start isEmpty. Operand 2894 states and 10120 transitions. [2018-06-26 17:31:02,382 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:31:02,382 INFO ]: Found error trace [2018-06-26 17:31:02,382 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:31:02,382 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:31:02,383 INFO ]: Analyzing trace with hash 1924802014, now seen corresponding path program 1 times [2018-06-26 17:31:02,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:31:02,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:31:02,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:31:02,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:31:02,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:31:02,420 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:31:02,843 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:31:02,844 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:31:02,844 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:31:02,844 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:31:02,844 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:31:02,844 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:31:02,844 INFO ]: Start difference. First operand 2894 states and 10120 transitions. Second operand 6 states. [2018-06-26 17:31:03,946 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-26 17:31:08,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:31:08,944 INFO ]: Finished difference Result 4416 states and 25566 transitions. [2018-06-26 17:31:08,944 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:31:08,944 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:31:08,944 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:31:09,675 INFO ]: With dead ends: 4416 [2018-06-26 17:31:09,675 INFO ]: Without dead ends: 4416 [2018-06-26 17:31:09,676 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:31:09,679 INFO ]: Start minimizeSevpa. Operand 4416 states. Received shutdown request... [2018-06-26 17:31:11,808 WARN ]: Verification canceled [2018-06-26 17:31:11,809 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:31:11,810 WARN ]: Timeout [2018-06-26 17:31:11,810 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:31:11 BasicIcfg [2018-06-26 17:31:11,810 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:31:11,811 INFO ]: Toolchain (without parser) took 54091.47 ms. Allocated memory was 305.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 241.5 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. [2018-06-26 17:31:11,812 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:31:11,812 INFO ]: ChcToBoogie took 99.92 ms. Allocated memory is still 305.1 MB. Free memory was 241.5 MB in the beginning and 237.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:31:11,813 INFO ]: Boogie Preprocessor took 96.77 ms. Allocated memory is still 305.1 MB. Free memory was 237.5 MB in the beginning and 235.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:31:11,813 INFO ]: RCFGBuilder took 1446.77 ms. Allocated memory was 305.1 MB in the beginning and 323.0 MB in the end (delta: 17.8 MB). Free memory was 235.5 MB in the beginning and 272.2 MB in the end (delta: -36.7 MB). Peak memory consumption was 57.5 MB. Max. memory is 3.6 GB. [2018-06-26 17:31:11,814 INFO ]: BlockEncodingV2 took 747.57 ms. Allocated memory is still 323.0 MB. Free memory was 272.2 MB in the beginning and 222.9 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 3.6 GB. [2018-06-26 17:31:11,814 INFO ]: TraceAbstraction took 51690.47 ms. Allocated memory was 323.0 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 222.9 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. [2018-06-26 17:31:11,817 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 145 locations, 279 edges - StatisticsResult: Encoded RCFG 135 locations, 268 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 99.92 ms. Allocated memory is still 305.1 MB. Free memory was 241.5 MB in the beginning and 237.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 96.77 ms. Allocated memory is still 305.1 MB. Free memory was 237.5 MB in the beginning and 235.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1446.77 ms. Allocated memory was 305.1 MB in the beginning and 323.0 MB in the end (delta: 17.8 MB). Free memory was 235.5 MB in the beginning and 272.2 MB in the end (delta: -36.7 MB). Peak memory consumption was 57.5 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 747.57 ms. Allocated memory is still 323.0 MB. Free memory was 272.2 MB in the beginning and 222.9 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 51690.47 ms. Allocated memory was 323.0 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 222.9 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. 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 executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. TIMEOUT Result, 51.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 40.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6596 SDtfs, 1136 SDslu, 10070 SDs, 0 SdLazy, 21517 SolverSat, 3210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2894occurred in iteration=8, 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: 7.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 3941 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 1473 SizeOfPredicates, 4 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 16/18 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/graham-scan-full.32.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-31-11-832.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/graham-scan-full.32.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-31-11-832.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/graham-scan-full.32.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-31-11-832.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/graham-scan-full.32.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-31-11-832.csv Completed graceful shutdown