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/point-location.47.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:37:41,513 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:37:41,515 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:37:41,529 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:37:41,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:37:41,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:37:41,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:37:41,539 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:37:41,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:37:41,542 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:37:41,543 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:37:41,543 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:37:41,544 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:37:41,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:37:41,546 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:37:41,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:37:41,548 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:37:41,549 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:37:41,560 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:37:41,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:37:41,563 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:37:41,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:37:41,567 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:37:41,567 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:37:41,568 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:37:41,568 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:37:41,577 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:37:41,578 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:37:41,578 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:37:41,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:37:41,579 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:37:41,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:37:41,580 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:37:41,580 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:37:41,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:37:41,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:37:41,582 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:37:41,635 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:37:41,636 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:37:41,636 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:37:41,636 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:37:41,637 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:37:41,638 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:37:41,638 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:37:41,638 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:37:41,638 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:37:41,638 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:37:41,639 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:37:41,639 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:37:41,639 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:37:41,639 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:37:41,639 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:37:41,640 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:37:41,640 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:37:41,640 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:37:41,640 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:37:41,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:37:41,641 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:37:41,643 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:37:41,643 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:37:41,687 INFO ]: Repository-Root is: /tmp [2018-06-26 17:37:41,698 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:37:41,702 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:37:41,703 INFO ]: Initializing SmtParser... [2018-06-26 17:37:41,703 INFO ]: SmtParser initialized [2018-06-26 17:37:41,704 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.47.smt2 [2018-06-26 17:37:41,707 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:37:41,873 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.47.smt2 unknown [2018-06-26 17:37:42,512 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.47.smt2 [2018-06-26 17:37:42,517 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:37:42,522 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:37:42,523 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:37:42,523 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:37:42,523 INFO ]: ChcToBoogie initialized [2018-06-26 17:37:42,526 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:37:42" (1/1) ... [2018-06-26 17:37:42,635 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:37:42 Unit [2018-06-26 17:37:42,642 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:37:42,642 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:37:42,643 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:37:42,643 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:37:42,664 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:37:42" (1/1) ... [2018-06-26 17:37:42,665 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:37:42" (1/1) ... [2018-06-26 17:37:42,685 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:37:42" (1/1) ... [2018-06-26 17:37:42,685 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:37:42" (1/1) ... [2018-06-26 17:37:42,715 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:37:42" (1/1) ... [2018-06-26 17:37:42,719 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:37:42" (1/1) ... [2018-06-26 17:37:42,722 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:37:42" (1/1) ... [2018-06-26 17:37:42,736 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:37:42,736 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:37:42,736 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:37:42,736 INFO ]: RCFGBuilder initialized [2018-06-26 17:37:42,737 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:37:42" (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:37:42,757 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:37:42,757 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:37:42,757 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:37:42,757 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:37:42,757 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:37:42,757 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:37:44,621 INFO ]: Using library mode [2018-06-26 17:37:44,621 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:37:44 BoogieIcfgContainer [2018-06-26 17:37:44,622 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:37:44,622 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:37:44,622 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:37:44,623 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:37:44,623 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:37:44" (1/1) ... [2018-06-26 17:37:44,660 INFO ]: Initial Icfg 147 locations, 288 edges [2018-06-26 17:37:44,661 INFO ]: Using Remove infeasible edges [2018-06-26 17:37:44,662 INFO ]: Using Maximize final states [2018-06-26 17:37:44,662 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:37:44,662 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:37:44,664 INFO ]: Using Remove sink states [2018-06-26 17:37:44,665 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:37:44,665 INFO ]: Using Use SBE [2018-06-26 17:37:44,675 INFO ]: SBE split 0 edges [2018-06-26 17:37:44,680 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-26 17:37:44,682 INFO ]: 0 new accepting states [2018-06-26 17:37:45,262 INFO ]: Removed 55 edges and 8 locations by large block encoding [2018-06-26 17:37:45,265 INFO ]: Removed 5 edges and 2 locations by removing sink states [2018-06-26 17:37:45,268 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:37:45,268 INFO ]: 0 new accepting states [2018-06-26 17:37:45,271 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:37:45,272 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:37:45,274 INFO ]: Encoded RCFG 135 locations, 271 edges [2018-06-26 17:37:45,274 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:37:45 BasicIcfg [2018-06-26 17:37:45,274 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:37:45,275 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:37:45,275 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:37:45,278 INFO ]: TraceAbstraction initialized [2018-06-26 17:37:45,279 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:37:42" (1/4) ... [2018-06-26 17:37:45,279 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2934f65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:37:45, skipping insertion in model container [2018-06-26 17:37:45,279 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:37:42" (2/4) ... [2018-06-26 17:37:45,280 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2934f65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:37:45, skipping insertion in model container [2018-06-26 17:37:45,280 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:37:44" (3/4) ... [2018-06-26 17:37:45,280 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2934f65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:37:45, skipping insertion in model container [2018-06-26 17:37:45,280 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:37:45" (4/4) ... [2018-06-26 17:37:45,282 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:37:45,291 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:37:45,313 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:37:45,348 INFO ]: Using default assertion order modulation [2018-06-26 17:37:45,349 INFO ]: Interprodecural is true [2018-06-26 17:37:45,349 INFO ]: Hoare is false [2018-06-26 17:37:45,349 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:37:45,349 INFO ]: Backedges is TWOTRACK [2018-06-26 17:37:45,349 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:37:45,349 INFO ]: Difference is false [2018-06-26 17:37:45,349 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:37:45,349 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:37:45,364 INFO ]: Start isEmpty. Operand 135 states. [2018-06-26 17:37:45,410 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:37:45,410 INFO ]: Found error trace [2018-06-26 17:37:45,411 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:37:45,412 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:37:45,417 INFO ]: Analyzing trace with hash 182566275, now seen corresponding path program 1 times [2018-06-26 17:37:45,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:37:45,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:37:45,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:37:45,451 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:37:45,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:37:45,530 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:37:45,717 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:37:45,720 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:37:45,720 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:37:45,721 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:37:45,737 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:37:45,737 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:37:45,740 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-26 17:37:47,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:37:47,893 INFO ]: Finished difference Result 267 states and 538 transitions. [2018-06-26 17:37:47,894 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:37:47,896 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:37:47,896 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:37:47,956 INFO ]: With dead ends: 267 [2018-06-26 17:37:47,956 INFO ]: Without dead ends: 267 [2018-06-26 17:37:47,958 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:37:47,979 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-26 17:37:48,090 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-26 17:37:48,092 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-26 17:37:48,113 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 538 transitions. [2018-06-26 17:37:48,115 INFO ]: Start accepts. Automaton has 267 states and 538 transitions. Word has length 5 [2018-06-26 17:37:48,116 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:37:48,116 INFO ]: Abstraction has 267 states and 538 transitions. [2018-06-26 17:37:48,116 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:37:48,116 INFO ]: Start isEmpty. Operand 267 states and 538 transitions. [2018-06-26 17:37:48,127 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:37:48,127 INFO ]: Found error trace [2018-06-26 17:37:48,127 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:37:48,127 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:37:48,127 INFO ]: Analyzing trace with hash 182654687, now seen corresponding path program 1 times [2018-06-26 17:37:48,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:37:48,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:37:48,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:37:48,128 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:37:48,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:37:48,147 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:37:48,235 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:37:48,235 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:37:48,236 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:37:48,237 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:37:48,237 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:37:48,237 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:37:48,238 INFO ]: Start difference. First operand 267 states and 538 transitions. Second operand 3 states. [2018-06-26 17:37:50,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:37:50,591 INFO ]: Finished difference Result 399 states and 806 transitions. [2018-06-26 17:37:50,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:37:50,591 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:37:50,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:37:50,616 INFO ]: With dead ends: 399 [2018-06-26 17:37:50,616 INFO ]: Without dead ends: 399 [2018-06-26 17:37:50,617 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:37:50,617 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-26 17:37:50,737 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-26 17:37:50,737 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-26 17:37:50,760 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 806 transitions. [2018-06-26 17:37:50,760 INFO ]: Start accepts. Automaton has 399 states and 806 transitions. Word has length 5 [2018-06-26 17:37:50,760 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:37:50,760 INFO ]: Abstraction has 399 states and 806 transitions. [2018-06-26 17:37:50,760 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:37:50,760 INFO ]: Start isEmpty. Operand 399 states and 806 transitions. [2018-06-26 17:37:50,823 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:37:50,823 INFO ]: Found error trace [2018-06-26 17:37:50,823 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:37:50,823 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:37:50,824 INFO ]: Analyzing trace with hash 657565403, now seen corresponding path program 1 times [2018-06-26 17:37:50,824 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:37:50,824 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:37:50,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:37:50,825 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:37:50,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:37:50,871 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:37:50,991 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:37:50,991 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:37:50,991 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:37:50,991 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:37:50,991 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:37:50,991 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:37:50,991 INFO ]: Start difference. First operand 399 states and 806 transitions. Second operand 6 states. [2018-06-26 17:37:56,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:37:56,819 INFO ]: Finished difference Result 1407 states and 4964 transitions. [2018-06-26 17:37:56,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:37:56,820 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:37:56,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:37:57,015 INFO ]: With dead ends: 1407 [2018-06-26 17:37:57,015 INFO ]: Without dead ends: 1240 [2018-06-26 17:37:57,015 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:37:57,017 INFO ]: Start minimizeSevpa. Operand 1240 states. [2018-06-26 17:37:57,425 INFO ]: Finished minimizeSevpa. Reduced states from 1240 to 760. [2018-06-26 17:37:57,425 INFO ]: Start removeUnreachable. Operand 760 states. [2018-06-26 17:37:57,453 INFO ]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1693 transitions. [2018-06-26 17:37:57,453 INFO ]: Start accepts. Automaton has 760 states and 1693 transitions. Word has length 10 [2018-06-26 17:37:57,453 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:37:57,453 INFO ]: Abstraction has 760 states and 1693 transitions. [2018-06-26 17:37:57,453 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:37:57,453 INFO ]: Start isEmpty. Operand 760 states and 1693 transitions. [2018-06-26 17:37:57,497 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:37:57,497 INFO ]: Found error trace [2018-06-26 17:37:57,497 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:37:57,497 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:37:57,499 INFO ]: Analyzing trace with hash 657569247, now seen corresponding path program 1 times [2018-06-26 17:37:57,499 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:37:57,499 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:37:57,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:37:57,500 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:37:57,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:37:57,537 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:37:57,776 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:37:57,776 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:37:57,776 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:37:57,776 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:37:57,776 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:37:57,776 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:37:57,776 INFO ]: Start difference. First operand 760 states and 1693 transitions. Second operand 6 states. [2018-06-26 17:38:02,322 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:38:02,322 INFO ]: Finished difference Result 1655 states and 6800 transitions. [2018-06-26 17:38:02,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:38:02,323 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:38:02,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:38:02,529 INFO ]: With dead ends: 1655 [2018-06-26 17:38:02,529 INFO ]: Without dead ends: 1655 [2018-06-26 17:38:02,529 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:38:02,531 INFO ]: Start minimizeSevpa. Operand 1655 states. [2018-06-26 17:38:02,970 INFO ]: Finished minimizeSevpa. Reduced states from 1655 to 1015. [2018-06-26 17:38:02,971 INFO ]: Start removeUnreachable. Operand 1015 states. [2018-06-26 17:38:03,009 INFO ]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 2497 transitions. [2018-06-26 17:38:03,009 INFO ]: Start accepts. Automaton has 1015 states and 2497 transitions. Word has length 10 [2018-06-26 17:38:03,009 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:38:03,009 INFO ]: Abstraction has 1015 states and 2497 transitions. [2018-06-26 17:38:03,009 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:38:03,009 INFO ]: Start isEmpty. Operand 1015 states and 2497 transitions. [2018-06-26 17:38:03,044 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:38:03,044 INFO ]: Found error trace [2018-06-26 17:38:03,044 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:38:03,044 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:38:03,044 INFO ]: Analyzing trace with hash 657570208, now seen corresponding path program 1 times [2018-06-26 17:38:03,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:38:03,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:38:03,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:38:03,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:38:03,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:38:03,078 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:38:03,519 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:38:03,519 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:38:03,519 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:38:03,519 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:38:03,519 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:38:03,519 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:38:03,519 INFO ]: Start difference. First operand 1015 states and 2497 transitions. Second operand 6 states. [2018-06-26 17:38:06,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:38:06,721 INFO ]: Finished difference Result 1652 states and 6126 transitions. [2018-06-26 17:38:06,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:38:06,721 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:38:06,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:38:06,820 INFO ]: With dead ends: 1652 [2018-06-26 17:38:06,820 INFO ]: Without dead ends: 1652 [2018-06-26 17:38:06,820 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:38:06,821 INFO ]: Start minimizeSevpa. Operand 1652 states. [2018-06-26 17:38:07,159 INFO ]: Finished minimizeSevpa. Reduced states from 1652 to 1015. [2018-06-26 17:38:07,159 INFO ]: Start removeUnreachable. Operand 1015 states. [2018-06-26 17:38:07,196 INFO ]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 2477 transitions. [2018-06-26 17:38:07,197 INFO ]: Start accepts. Automaton has 1015 states and 2477 transitions. Word has length 10 [2018-06-26 17:38:07,197 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:38:07,198 INFO ]: Abstraction has 1015 states and 2477 transitions. [2018-06-26 17:38:07,198 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:38:07,198 INFO ]: Start isEmpty. Operand 1015 states and 2477 transitions. [2018-06-26 17:38:07,237 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:38:07,237 INFO ]: Found error trace [2018-06-26 17:38:07,237 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:38:07,238 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:38:07,239 INFO ]: Analyzing trace with hash -370843810, now seen corresponding path program 1 times [2018-06-26 17:38:07,239 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:38:07,239 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:38:07,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:38:07,239 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:38:07,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:38:07,265 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:38:07,686 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:38:07,686 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:38:07,686 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:38:07,686 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:38:07,686 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:38:07,686 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:38:07,686 INFO ]: Start difference. First operand 1015 states and 2477 transitions. Second operand 6 states. [2018-06-26 17:38:12,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:38:12,983 INFO ]: Finished difference Result 3424 states and 15119 transitions. [2018-06-26 17:38:12,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:38:12,983 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:38:12,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:38:13,306 INFO ]: With dead ends: 3424 [2018-06-26 17:38:13,306 INFO ]: Without dead ends: 3424 [2018-06-26 17:38:13,306 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:38:13,308 INFO ]: Start minimizeSevpa. Operand 3424 states. [2018-06-26 17:38:14,234 INFO ]: Finished minimizeSevpa. Reduced states from 3424 to 2072. [2018-06-26 17:38:14,235 INFO ]: Start removeUnreachable. Operand 2072 states. [2018-06-26 17:38:14,334 INFO ]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 6336 transitions. [2018-06-26 17:38:14,334 INFO ]: Start accepts. Automaton has 2072 states and 6336 transitions. Word has length 10 [2018-06-26 17:38:14,334 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:38:14,334 INFO ]: Abstraction has 2072 states and 6336 transitions. [2018-06-26 17:38:14,334 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:38:14,334 INFO ]: Start isEmpty. Operand 2072 states and 6336 transitions. [2018-06-26 17:38:14,361 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:38:14,361 INFO ]: Found error trace [2018-06-26 17:38:14,361 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:38:14,361 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:38:14,362 INFO ]: Analyzing trace with hash -256327206, now seen corresponding path program 1 times [2018-06-26 17:38:14,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:38:14,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:38:14,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:38:14,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:38:14,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:38:14,383 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:38:14,774 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:38:14,775 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:38:14,775 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:38:14,775 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:38:14,775 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:38:14,775 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:38:14,775 INFO ]: Start difference. First operand 2072 states and 6336 transitions. Second operand 6 states. [2018-06-26 17:38:19,719 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:38:19,719 INFO ]: Finished difference Result 5866 states and 31420 transitions. [2018-06-26 17:38:19,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:38:19,724 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:38:19,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:38:20,474 INFO ]: With dead ends: 5866 [2018-06-26 17:38:20,475 INFO ]: Without dead ends: 5681 [2018-06-26 17:38:20,475 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:38:20,479 INFO ]: Start minimizeSevpa. Operand 5681 states. [2018-06-26 17:38:24,112 INFO ]: Finished minimizeSevpa. Reduced states from 5681 to 3616. [2018-06-26 17:38:24,112 INFO ]: Start removeUnreachable. Operand 3616 states. [2018-06-26 17:38:24,280 INFO ]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 15133 transitions. [2018-06-26 17:38:24,280 INFO ]: Start accepts. Automaton has 3616 states and 15133 transitions. Word has length 10 [2018-06-26 17:38:24,280 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:38:24,280 INFO ]: Abstraction has 3616 states and 15133 transitions. [2018-06-26 17:38:24,280 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:38:24,280 INFO ]: Start isEmpty. Operand 3616 states and 15133 transitions. [2018-06-26 17:38:24,318 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:38:24,327 INFO ]: Found error trace [2018-06-26 17:38:24,327 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:38:24,327 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:38:24,329 INFO ]: Analyzing trace with hash -227698055, now seen corresponding path program 1 times [2018-06-26 17:38:24,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:38:24,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:38:24,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:38:24,329 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:38:24,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:38:24,347 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:38:24,766 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:38:24,766 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:38:24,766 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:38:24,766 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:38:24,767 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:38:24,767 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:38:24,767 INFO ]: Start difference. First operand 3616 states and 15133 transitions. Second operand 6 states. [2018-06-26 17:38:30,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:38:30,615 INFO ]: Finished difference Result 8097 states and 52493 transitions. [2018-06-26 17:38:30,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:38:30,615 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:38:30,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:38:32,326 INFO ]: With dead ends: 8097 [2018-06-26 17:38:32,326 INFO ]: Without dead ends: 8097 [2018-06-26 17:38:32,326 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:38:32,328 INFO ]: Start minimizeSevpa. Operand 8097 states. Received shutdown request... [2018-06-26 17:38:37,686 INFO ]: Finished minimizeSevpa. Reduced states from 8097 to 5464. [2018-06-26 17:38:37,686 INFO ]: Start removeUnreachable. Operand 5464 states. [2018-06-26 17:38:37,687 WARN ]: Verification canceled [2018-06-26 17:38:37,689 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:38:37,690 WARN ]: Timeout [2018-06-26 17:38:37,691 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:38:37 BasicIcfg [2018-06-26 17:38:37,691 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:38:37,691 INFO ]: Toolchain (without parser) took 55173.91 ms. Allocated memory was 308.3 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 238.9 MB in the beginning and 695.3 MB in the end (delta: -456.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. [2018-06-26 17:38:37,692 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:38:37,693 INFO ]: ChcToBoogie took 119.37 ms. Allocated memory is still 308.3 MB. Free memory was 238.9 MB in the beginning and 233.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:38:37,693 INFO ]: Boogie Preprocessor took 93.15 ms. Allocated memory is still 308.3 MB. Free memory was 233.9 MB in the beginning and 231.9 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:38:37,694 INFO ]: RCFGBuilder took 1885.42 ms. Allocated memory was 308.3 MB in the beginning and 322.4 MB in the end (delta: 14.2 MB). Free memory was 231.9 MB in the beginning and 256.4 MB in the end (delta: -24.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 3.6 GB. [2018-06-26 17:38:37,694 INFO ]: BlockEncodingV2 took 652.20 ms. Allocated memory is still 322.4 MB. Free memory was 256.4 MB in the beginning and 215.3 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:38:37,695 INFO ]: TraceAbstraction took 52415.16 ms. Allocated memory was 322.4 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 213.8 MB in the beginning and 695.3 MB in the end (delta: -481.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. [2018-06-26 17:38:37,698 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 147 locations, 288 edges - StatisticsResult: Encoded RCFG 135 locations, 271 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 119.37 ms. Allocated memory is still 308.3 MB. Free memory was 238.9 MB in the beginning and 233.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 93.15 ms. Allocated memory is still 308.3 MB. Free memory was 233.9 MB in the beginning and 231.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1885.42 ms. Allocated memory was 308.3 MB in the beginning and 322.4 MB in the end (delta: 14.2 MB). Free memory was 231.9 MB in the beginning and 256.4 MB in the end (delta: -24.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 652.20 ms. Allocated memory is still 322.4 MB. Free memory was 256.4 MB in the beginning and 215.3 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52415.16 ms. Allocated memory was 322.4 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 213.8 MB in the beginning and 695.3 MB in the end (delta: -481.5 MB). Peak memory consumption was 1.5 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 ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. TIMEOUT Result, 52.3s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 37.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6678 SDtfs, 1217 SDslu, 12061 SDs, 0 SdLazy, 19970 SolverSat, 3545 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3616occurred in iteration=7, 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: 11.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 5174 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 1288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12/12 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/point-location.47.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-38-37-715.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.47.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-38-37-715.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.47.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-38-37-715.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.47.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-38-37-715.csv Completed graceful shutdown