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.48.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:36:39,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:36:39,689 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:36:39,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:36:39,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:36:39,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:36:39,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:36:39,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:36:39,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:36:39,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:36:39,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:36:39,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:36:39,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:36:39,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:36:39,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:36:39,714 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:36:39,716 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:36:39,718 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:36:39,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:36:39,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:36:39,721 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:36:39,724 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:36:39,724 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:36:39,724 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:36:39,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:36:39,726 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:36:39,727 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:36:39,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:36:39,729 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:36:39,729 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:36:39,730 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:36:39,730 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:36:39,730 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:36:39,731 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:36:39,732 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:36:39,732 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:36:39,747 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:36:39,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:36:39,747 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:36:39,748 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:36:39,749 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:36:39,749 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:36:39,749 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:36:39,749 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:36:39,749 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:36:39,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:36:39,750 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:36:39,750 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:36:39,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:36:39,750 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:36:39,751 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:36:39,751 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:36:39,751 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:36:39,751 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:36:39,751 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:36:39,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:36:39,753 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:36:39,754 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:36:39,754 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:36:39,802 INFO ]: Repository-Root is: /tmp [2018-06-24 20:36:39,817 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:36:39,820 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:36:39,821 INFO ]: Initializing SmtParser... [2018-06-24 20:36:39,821 INFO ]: SmtParser initialized [2018-06-24 20:36:39,822 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.48.smt2 [2018-06-24 20:36:39,823 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-24 20:36:39,890 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.48.smt2 unknown [2018-06-24 20:36:40,510 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.48.smt2 [2018-06-24 20:36:40,524 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:36:40,531 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:36:40,532 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:36:40,532 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:36:40,532 INFO ]: ChcToBoogie initialized [2018-06-24 20:36:40,535 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:36:40" (1/1) ... [2018-06-24 20:36:40,617 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:40 Unit [2018-06-24 20:36:40,617 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:36:40,618 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:36:40,618 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:36:40,618 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:36:40,638 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:40" (1/1) ... [2018-06-24 20:36:40,638 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:40" (1/1) ... [2018-06-24 20:36:40,654 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:40" (1/1) ... [2018-06-24 20:36:40,654 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:40" (1/1) ... [2018-06-24 20:36:40,685 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:40" (1/1) ... [2018-06-24 20:36:40,699 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:40" (1/1) ... [2018-06-24 20:36:40,704 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:40" (1/1) ... [2018-06-24 20:36:40,718 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:36:40,719 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:36:40,719 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:36:40,719 INFO ]: RCFGBuilder initialized [2018-06-24 20:36:40,720 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:40" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:36:40,735 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:36:40,735 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:36:40,735 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:36:40,735 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:36:40,735 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:36:40,735 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 20:36:42,239 INFO ]: Using library mode [2018-06-24 20:36:42,240 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:36:42 BoogieIcfgContainer [2018-06-24 20:36:42,240 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:36:42,241 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:36:42,241 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:36:42,242 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:36:42,242 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:36:42" (1/1) ... [2018-06-24 20:36:42,306 INFO ]: Initial Icfg 147 locations, 287 edges [2018-06-24 20:36:42,307 INFO ]: Using Remove infeasible edges [2018-06-24 20:36:42,308 INFO ]: Using Maximize final states [2018-06-24 20:36:42,308 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:36:42,308 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:36:42,310 INFO ]: Using Remove sink states [2018-06-24 20:36:42,311 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:36:42,311 INFO ]: Using Use SBE [2018-06-24 20:36:42,329 INFO ]: SBE split 0 edges [2018-06-24 20:36:42,338 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:36:42,341 INFO ]: 0 new accepting states [2018-06-24 20:36:43,262 INFO ]: Removed 64 edges and 9 locations by large block encoding [2018-06-24 20:36:43,266 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:36:43,270 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:36:43,271 INFO ]: 0 new accepting states [2018-06-24 20:36:43,275 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:36:43,276 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:36:43,278 INFO ]: Encoded RCFG 135 locations, 274 edges [2018-06-24 20:36:43,281 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:36:43 BasicIcfg [2018-06-24 20:36:43,281 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:36:43,283 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:36:43,283 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:36:43,288 INFO ]: TraceAbstraction initialized [2018-06-24 20:36:43,289 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:36:40" (1/4) ... [2018-06-24 20:36:43,290 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25728f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:36:43, skipping insertion in model container [2018-06-24 20:36:43,290 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:40" (2/4) ... [2018-06-24 20:36:43,290 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25728f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:36:43, skipping insertion in model container [2018-06-24 20:36:43,290 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:36:42" (3/4) ... [2018-06-24 20:36:43,290 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25728f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:36:43, skipping insertion in model container [2018-06-24 20:36:43,290 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:36:43" (4/4) ... [2018-06-24 20:36:43,295 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:36:43,308 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:36:43,323 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:36:43,369 INFO ]: Using default assertion order modulation [2018-06-24 20:36:43,370 INFO ]: Interprodecural is true [2018-06-24 20:36:43,370 INFO ]: Hoare is false [2018-06-24 20:36:43,370 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:36:43,370 INFO ]: Backedges is TWOTRACK [2018-06-24 20:36:43,370 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:36:43,370 INFO ]: Difference is false [2018-06-24 20:36:43,370 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:36:43,370 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:36:43,390 INFO ]: Start isEmpty. Operand 135 states. [2018-06-24 20:36:43,446 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:36:43,446 INFO ]: Found error trace [2018-06-24 20:36:43,447 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:36:43,447 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:43,452 INFO ]: Analyzing trace with hash 5886331, now seen corresponding path program 1 times [2018-06-24 20:36:43,454 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:43,454 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:43,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:43,485 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:43,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:43,565 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:43,729 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:36:43,731 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:43,731 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:36:43,732 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:36:43,743 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:36:43,743 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:36:43,746 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-24 20:36:45,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:45,230 INFO ]: Finished difference Result 136 states and 372 transitions. [2018-06-24 20:36:45,231 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:36:45,232 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:36:45,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:45,273 INFO ]: With dead ends: 136 [2018-06-24 20:36:45,273 INFO ]: Without dead ends: 136 [2018-06-24 20:36:45,274 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-24 20:36:45,292 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-24 20:36:45,404 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-06-24 20:36:45,405 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-24 20:36:45,417 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 372 transitions. [2018-06-24 20:36:45,418 INFO ]: Start accepts. Automaton has 136 states and 372 transitions. Word has length 4 [2018-06-24 20:36:45,419 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:45,419 INFO ]: Abstraction has 136 states and 372 transitions. [2018-06-24 20:36:45,419 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:36:45,419 INFO ]: Start isEmpty. Operand 136 states and 372 transitions. [2018-06-24 20:36:45,428 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:36:45,428 INFO ]: Found error trace [2018-06-24 20:36:45,428 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:36:45,429 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:45,429 INFO ]: Analyzing trace with hash 182631529, now seen corresponding path program 1 times [2018-06-24 20:36:45,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:45,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:45,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:45,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:45,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:45,448 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:45,530 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:36:45,530 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:45,530 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:36:45,531 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:36:45,531 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:36:45,531 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:36:45,532 INFO ]: Start difference. First operand 136 states and 372 transitions. Second operand 3 states. [2018-06-24 20:36:47,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:47,752 INFO ]: Finished difference Result 269 states and 740 transitions. [2018-06-24 20:36:47,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:36:47,753 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:36:47,753 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:47,772 INFO ]: With dead ends: 269 [2018-06-24 20:36:47,772 INFO ]: Without dead ends: 269 [2018-06-24 20:36:47,773 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-24 20:36:47,774 INFO ]: Start minimizeSevpa. Operand 269 states. [2018-06-24 20:36:47,874 INFO ]: Finished minimizeSevpa. Reduced states from 269 to 268. [2018-06-24 20:36:47,874 INFO ]: Start removeUnreachable. Operand 268 states. [2018-06-24 20:36:47,882 INFO ]: Finished removeUnreachable. Reduced from 268 states to 268 states and 546 transitions. [2018-06-24 20:36:47,882 INFO ]: Start accepts. Automaton has 268 states and 546 transitions. Word has length 5 [2018-06-24 20:36:47,883 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:47,883 INFO ]: Abstraction has 268 states and 546 transitions. [2018-06-24 20:36:47,883 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:36:47,883 INFO ]: Start isEmpty. Operand 268 states and 546 transitions. [2018-06-24 20:36:47,911 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:36:47,911 INFO ]: Found error trace [2018-06-24 20:36:47,911 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:47,911 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:47,911 INFO ]: Analyzing trace with hash -69777820, now seen corresponding path program 1 times [2018-06-24 20:36:47,911 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:47,911 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:47,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:47,912 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:47,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:47,956 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:48,073 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:48,074 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:48,074 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:36:48,074 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:36:48,074 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:36:48,074 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:36:48,074 INFO ]: Start difference. First operand 268 states and 546 transitions. Second operand 5 states. [2018-06-24 20:36:51,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:51,019 INFO ]: Finished difference Result 721 states and 2453 transitions. [2018-06-24 20:36:51,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:36:51,019 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:36:51,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:51,086 INFO ]: With dead ends: 721 [2018-06-24 20:36:51,086 INFO ]: Without dead ends: 721 [2018-06-24 20:36:51,086 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:36:51,087 INFO ]: Start minimizeSevpa. Operand 721 states. [2018-06-24 20:36:51,364 INFO ]: Finished minimizeSevpa. Reduced states from 721 to 463. [2018-06-24 20:36:51,365 INFO ]: Start removeUnreachable. Operand 463 states. [2018-06-24 20:36:51,382 INFO ]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1310 transitions. [2018-06-24 20:36:51,382 INFO ]: Start accepts. Automaton has 463 states and 1310 transitions. Word has length 9 [2018-06-24 20:36:51,382 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:51,382 INFO ]: Abstraction has 463 states and 1310 transitions. [2018-06-24 20:36:51,382 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:36:51,382 INFO ]: Start isEmpty. Operand 463 states and 1310 transitions. [2018-06-24 20:36:51,411 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:36:51,411 INFO ]: Found error trace [2018-06-24 20:36:51,411 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:51,411 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:51,411 INFO ]: Analyzing trace with hash -69784547, now seen corresponding path program 1 times [2018-06-24 20:36:51,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:51,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:51,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:51,412 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:51,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:51,435 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:51,688 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:51,688 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:51,688 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:36:51,688 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:36:51,689 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:36:51,689 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:36:51,689 INFO ]: Start difference. First operand 463 states and 1310 transitions. Second operand 5 states. [2018-06-24 20:36:54,235 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:54,235 INFO ]: Finished difference Result 966 states and 3296 transitions. [2018-06-24 20:36:54,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:36:54,239 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:36:54,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:54,335 INFO ]: With dead ends: 966 [2018-06-24 20:36:54,336 INFO ]: Without dead ends: 966 [2018-06-24 20:36:54,336 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-24 20:36:54,337 INFO ]: Start minimizeSevpa. Operand 966 states. [2018-06-24 20:36:54,653 INFO ]: Finished minimizeSevpa. Reduced states from 966 to 649. [2018-06-24 20:36:54,653 INFO ]: Start removeUnreachable. Operand 649 states. [2018-06-24 20:36:54,674 INFO ]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1839 transitions. [2018-06-24 20:36:54,674 INFO ]: Start accepts. Automaton has 649 states and 1839 transitions. Word has length 9 [2018-06-24 20:36:54,675 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:54,675 INFO ]: Abstraction has 649 states and 1839 transitions. [2018-06-24 20:36:54,675 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:36:54,675 INFO ]: Start isEmpty. Operand 649 states and 1839 transitions. [2018-06-24 20:36:54,712 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:36:54,712 INFO ]: Found error trace [2018-06-24 20:36:54,712 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:54,712 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:54,712 INFO ]: Analyzing trace with hash -1585887839, now seen corresponding path program 1 times [2018-06-24 20:36:54,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:54,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:54,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:54,713 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:54,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:54,741 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:54,831 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:54,831 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:54,832 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:36:54,832 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:36:54,832 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:36:54,832 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:36:54,832 INFO ]: Start difference. First operand 649 states and 1839 transitions. Second operand 3 states. [2018-06-24 20:36:56,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:56,630 INFO ]: Finished difference Result 407 states and 851 transitions. [2018-06-24 20:36:56,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:36:56,630 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 20:36:56,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:56,646 INFO ]: With dead ends: 407 [2018-06-24 20:36:56,646 INFO ]: Without dead ends: 407 [2018-06-24 20:36:56,646 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-24 20:36:56,647 INFO ]: Start minimizeSevpa. Operand 407 states. [2018-06-24 20:36:56,694 INFO ]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-06-24 20:36:56,694 INFO ]: Start removeUnreachable. Operand 407 states. [2018-06-24 20:36:56,703 INFO ]: Finished removeUnreachable. Reduced from 407 states to 407 states and 851 transitions. [2018-06-24 20:36:56,703 INFO ]: Start accepts. Automaton has 407 states and 851 transitions. Word has length 9 [2018-06-24 20:36:56,703 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:56,703 INFO ]: Abstraction has 407 states and 851 transitions. [2018-06-24 20:36:56,703 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:36:56,703 INFO ]: Start isEmpty. Operand 407 states and 851 transitions. [2018-06-24 20:36:56,728 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:36:56,728 INFO ]: Found error trace [2018-06-24 20:36:56,728 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:56,729 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:56,729 INFO ]: Analyzing trace with hash -865745741, now seen corresponding path program 1 times [2018-06-24 20:36:56,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:56,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:56,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:56,729 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:56,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:56,758 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:57,031 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:57,032 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:57,032 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:36:57,032 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:36:57,032 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:36:57,032 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:36:57,032 INFO ]: Start difference. First operand 407 states and 851 transitions. Second operand 5 states. [2018-06-24 20:36:58,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:58,855 INFO ]: Finished difference Result 1035 states and 2904 transitions. [2018-06-24 20:36:58,858 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:36:58,858 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:36:58,858 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:58,904 INFO ]: With dead ends: 1035 [2018-06-24 20:36:58,904 INFO ]: Without dead ends: 1035 [2018-06-24 20:36:58,904 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-24 20:36:58,905 INFO ]: Start minimizeSevpa. Operand 1035 states. [2018-06-24 20:36:59,117 INFO ]: Finished minimizeSevpa. Reduced states from 1035 to 810. [2018-06-24 20:36:59,117 INFO ]: Start removeUnreachable. Operand 810 states. [2018-06-24 20:36:59,203 INFO ]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1713 transitions. [2018-06-24 20:36:59,203 INFO ]: Start accepts. Automaton has 810 states and 1713 transitions. Word has length 9 [2018-06-24 20:36:59,205 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:59,205 INFO ]: Abstraction has 810 states and 1713 transitions. [2018-06-24 20:36:59,205 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:36:59,205 INFO ]: Start isEmpty. Operand 810 states and 1713 transitions. [2018-06-24 20:36:59,236 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:36:59,236 INFO ]: Found error trace [2018-06-24 20:36:59,236 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:59,236 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:59,237 INFO ]: Analyzing trace with hash 2131563279, now seen corresponding path program 1 times [2018-06-24 20:36:59,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:59,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:59,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:59,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:59,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:59,268 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:59,412 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:59,412 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:59,412 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:36:59,412 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:36:59,412 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:36:59,413 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:36:59,413 INFO ]: Start difference. First operand 810 states and 1713 transitions. Second operand 6 states. [2018-06-24 20:37:01,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:37:01,499 INFO ]: Finished difference Result 1520 states and 6486 transitions. [2018-06-24 20:37:01,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:37:01,500 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:37:01,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:37:01,612 INFO ]: With dead ends: 1520 [2018-06-24 20:37:01,612 INFO ]: Without dead ends: 1520 [2018-06-24 20:37:01,612 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:37:01,614 INFO ]: Start minimizeSevpa. Operand 1520 states. [2018-06-24 20:37:02,266 INFO ]: Finished minimizeSevpa. Reduced states from 1520 to 815. [2018-06-24 20:37:02,266 INFO ]: Start removeUnreachable. Operand 815 states. [2018-06-24 20:37:02,292 INFO ]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1758 transitions. [2018-06-24 20:37:02,292 INFO ]: Start accepts. Automaton has 815 states and 1758 transitions. Word has length 10 [2018-06-24 20:37:02,292 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:37:02,292 INFO ]: Abstraction has 815 states and 1758 transitions. [2018-06-24 20:37:02,292 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:37:02,292 INFO ]: Start isEmpty. Operand 815 states and 1758 transitions. [2018-06-24 20:37:02,325 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:37:02,325 INFO ]: Found error trace [2018-06-24 20:37:02,325 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:37:02,325 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:37:02,325 INFO ]: Analyzing trace with hash 2125426333, now seen corresponding path program 1 times [2018-06-24 20:37:02,325 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:37:02,325 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:37:02,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:02,326 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:37:02,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:02,349 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:37:02,523 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:37:02,523 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:37:02,523 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:37:02,523 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:37:02,523 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:37:02,523 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:37:02,523 INFO ]: Start difference. First operand 815 states and 1758 transitions. Second operand 6 states. [2018-06-24 20:37:05,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:37:05,139 INFO ]: Finished difference Result 2495 states and 10612 transitions. [2018-06-24 20:37:05,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:37:05,140 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:37:05,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:37:05,322 INFO ]: With dead ends: 2495 [2018-06-24 20:37:05,322 INFO ]: Without dead ends: 2121 [2018-06-24 20:37:05,323 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:37:05,324 INFO ]: Start minimizeSevpa. Operand 2121 states. [2018-06-24 20:37:06,090 INFO ]: Finished minimizeSevpa. Reduced states from 2121 to 845. [2018-06-24 20:37:06,091 INFO ]: Start removeUnreachable. Operand 845 states. [2018-06-24 20:37:06,113 INFO ]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1856 transitions. [2018-06-24 20:37:06,113 INFO ]: Start accepts. Automaton has 845 states and 1856 transitions. Word has length 10 [2018-06-24 20:37:06,113 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:37:06,113 INFO ]: Abstraction has 845 states and 1856 transitions. [2018-06-24 20:37:06,113 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:37:06,113 INFO ]: Start isEmpty. Operand 845 states and 1856 transitions. [2018-06-24 20:37:06,130 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:37:06,130 INFO ]: Found error trace [2018-06-24 20:37:06,130 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:37:06,130 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:37:06,130 INFO ]: Analyzing trace with hash -23019885, now seen corresponding path program 1 times [2018-06-24 20:37:06,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:37:06,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:37:06,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:06,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:37:06,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:06,146 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:37:06,220 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:37:06,220 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:37:06,220 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:37:06,220 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:37:06,221 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:37:06,221 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:37:06,221 INFO ]: Start difference. First operand 845 states and 1856 transitions. Second operand 3 states. [2018-06-24 20:37:06,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:37:06,972 INFO ]: Finished difference Result 1181 states and 2591 transitions. [2018-06-24 20:37:06,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:37:06,972 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 20:37:06,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:37:07,015 INFO ]: With dead ends: 1181 [2018-06-24 20:37:07,015 INFO ]: Without dead ends: 1181 [2018-06-24 20:37:07,015 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-24 20:37:07,016 INFO ]: Start minimizeSevpa. Operand 1181 states. [2018-06-24 20:37:07,144 INFO ]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2018-06-24 20:37:07,144 INFO ]: Start removeUnreachable. Operand 1181 states. [2018-06-24 20:37:07,183 INFO ]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2591 transitions. [2018-06-24 20:37:07,183 INFO ]: Start accepts. Automaton has 1181 states and 2591 transitions. Word has length 10 [2018-06-24 20:37:07,183 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:37:07,183 INFO ]: Abstraction has 1181 states and 2591 transitions. [2018-06-24 20:37:07,183 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:37:07,183 INFO ]: Start isEmpty. Operand 1181 states and 2591 transitions. [2018-06-24 20:37:07,204 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:37:07,204 INFO ]: Found error trace [2018-06-24 20:37:07,204 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:37:07,204 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:37:07,204 INFO ]: Analyzing trace with hash 95064595, now seen corresponding path program 1 times [2018-06-24 20:37:07,204 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:37:07,204 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:37:07,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:07,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:37:07,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:07,222 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:37:07,649 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:37:07,649 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:37:07,649 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:37:07,649 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:37:07,649 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:37:07,649 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:37:07,650 INFO ]: Start difference. First operand 1181 states and 2591 transitions. Second operand 6 states. [2018-06-24 20:37:12,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:37:12,533 INFO ]: Finished difference Result 2670 states and 10551 transitions. [2018-06-24 20:37:12,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:37:12,533 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:37:12,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:37:12,735 INFO ]: With dead ends: 2670 [2018-06-24 20:37:12,735 INFO ]: Without dead ends: 2670 [2018-06-24 20:37:12,735 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:37:12,736 INFO ]: Start minimizeSevpa. Operand 2670 states. [2018-06-24 20:37:13,327 INFO ]: Finished minimizeSevpa. Reduced states from 2670 to 1813. [2018-06-24 20:37:13,328 INFO ]: Start removeUnreachable. Operand 1813 states. [2018-06-24 20:37:13,424 INFO ]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 4990 transitions. [2018-06-24 20:37:13,424 INFO ]: Start accepts. Automaton has 1813 states and 4990 transitions. Word has length 10 [2018-06-24 20:37:13,424 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:37:13,424 INFO ]: Abstraction has 1813 states and 4990 transitions. [2018-06-24 20:37:13,424 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:37:13,424 INFO ]: Start isEmpty. Operand 1813 states and 4990 transitions. [2018-06-24 20:37:13,462 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:37:13,462 INFO ]: Found error trace [2018-06-24 20:37:13,462 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:37:13,463 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:37:13,463 INFO ]: Analyzing trace with hash -105339462, now seen corresponding path program 1 times [2018-06-24 20:37:13,463 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:37:13,463 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:37:13,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:13,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:37:13,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:13,482 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:37:13,612 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:37:13,612 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:37:13,612 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:37:13,612 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:37:13,612 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:37:13,612 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:37:13,612 INFO ]: Start difference. First operand 1813 states and 4990 transitions. Second operand 6 states. [2018-06-24 20:37:13,782 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-24 20:37:18,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:37:18,376 INFO ]: Finished difference Result 4155 states and 18804 transitions. [2018-06-24 20:37:18,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:37:18,377 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:37:18,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:37:18,933 INFO ]: With dead ends: 4155 [2018-06-24 20:37:18,933 INFO ]: Without dead ends: 4155 [2018-06-24 20:37:18,934 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:37:18,936 INFO ]: Start minimizeSevpa. Operand 4155 states. [2018-06-24 20:37:21,031 INFO ]: Finished minimizeSevpa. Reduced states from 4155 to 2930. [2018-06-24 20:37:21,031 INFO ]: Start removeUnreachable. Operand 2930 states. [2018-06-24 20:37:21,176 INFO ]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 9957 transitions. [2018-06-24 20:37:21,176 INFO ]: Start accepts. Automaton has 2930 states and 9957 transitions. Word has length 10 [2018-06-24 20:37:21,177 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:37:21,177 INFO ]: Abstraction has 2930 states and 9957 transitions. [2018-06-24 20:37:21,177 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:37:21,177 INFO ]: Start isEmpty. Operand 2930 states and 9957 transitions. [2018-06-24 20:37:21,235 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:37:21,235 INFO ]: Found error trace [2018-06-24 20:37:21,235 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:37:21,235 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:37:21,236 INFO ]: Analyzing trace with hash -1075964169, now seen corresponding path program 1 times [2018-06-24 20:37:21,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:37:21,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:37:21,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:21,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:37:21,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:21,257 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:37:21,323 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:37:21,323 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:37:21,323 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-24 20:37:21,329 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:37:21,389 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:37:21,399 INFO ]: Computing forward predicates... [2018-06-24 20:37:21,642 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:37:21,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:37:21,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 20:37:21,664 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:37:21,664 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:37:21,664 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:37:21,664 INFO ]: Start difference. First operand 2930 states and 9957 transitions. Second operand 10 states. [2018-06-24 20:37:25,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:37:25,359 INFO ]: Finished difference Result 4857 states and 24393 transitions. [2018-06-24 20:37:25,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:37:25,381 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:37:25,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:37:26,162 INFO ]: With dead ends: 4857 [2018-06-24 20:37:26,162 INFO ]: Without dead ends: 4857 [2018-06-24 20:37:26,163 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:37:26,165 INFO ]: Start minimizeSevpa. Operand 4857 states. [2018-06-24 20:37:28,806 INFO ]: Finished minimizeSevpa. Reduced states from 4857 to 2980. [2018-06-24 20:37:28,806 INFO ]: Start removeUnreachable. Operand 2980 states. [2018-06-24 20:37:29,029 INFO ]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 10199 transitions. [2018-06-24 20:37:29,030 INFO ]: Start accepts. Automaton has 2980 states and 10199 transitions. Word has length 10 [2018-06-24 20:37:29,030 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:37:29,030 INFO ]: Abstraction has 2980 states and 10199 transitions. [2018-06-24 20:37:29,030 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:37:29,030 INFO ]: Start isEmpty. Operand 2980 states and 10199 transitions. [2018-06-24 20:37:29,155 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:37:29,155 INFO ]: Found error trace [2018-06-24 20:37:29,155 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:37:29,155 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:37:29,155 INFO ]: Analyzing trace with hash 197067392, now seen corresponding path program 1 times [2018-06-24 20:37:29,155 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:37:29,155 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:37:29,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:29,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:37:29,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:29,183 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:37:29,260 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:37:29,261 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:37:29,261 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:37:29,261 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:37:29,261 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:37:29,261 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:37:29,261 INFO ]: Start difference. First operand 2980 states and 10199 transitions. Second operand 6 states. [2018-06-24 20:37:31,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:37:31,706 INFO ]: Finished difference Result 4860 states and 23884 transitions. [2018-06-24 20:37:31,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:37:31,706 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:37:31,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:37:32,506 INFO ]: With dead ends: 4860 [2018-06-24 20:37:32,506 INFO ]: Without dead ends: 4860 [2018-06-24 20:37:32,507 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:37:32,508 INFO ]: Start minimizeSevpa. Operand 4860 states. Received shutdown request... [2018-06-24 20:37:35,239 WARN ]: Verification canceled [2018-06-24 20:37:35,241 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:37:35,242 WARN ]: Timeout [2018-06-24 20:37:35,242 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:37:35 BasicIcfg [2018-06-24 20:37:35,242 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:37:35,243 INFO ]: Toolchain (without parser) took 54718.65 ms. Allocated memory was 307.8 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 238.2 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. [2018-06-24 20:37:35,244 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:37:35,244 INFO ]: ChcToBoogie took 85.44 ms. Allocated memory is still 307.8 MB. Free memory was 236.3 MB in the beginning and 232.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:37:35,252 INFO ]: Boogie Preprocessor took 100.45 ms. Allocated memory is still 307.8 MB. Free memory was 232.3 MB in the beginning and 230.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:37:35,252 INFO ]: RCFGBuilder took 1521.60 ms. Allocated memory was 307.8 MB in the beginning and 323.5 MB in the end (delta: 15.7 MB). Free memory was 230.2 MB in the beginning and 255.8 MB in the end (delta: -25.6 MB). Peak memory consumption was 49.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:37:35,253 INFO ]: BlockEncodingV2 took 1040.76 ms. Allocated memory is still 323.5 MB. Free memory was 255.8 MB in the beginning and 196.5 MB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:37:35,253 INFO ]: TraceAbstraction took 51959.61 ms. Allocated memory was 323.5 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 195.0 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-24 20:37:35,256 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 147 locations, 287 edges - StatisticsResult: Encoded RCFG 135 locations, 274 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 85.44 ms. Allocated memory is still 307.8 MB. Free memory was 236.3 MB in the beginning and 232.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 100.45 ms. Allocated memory is still 307.8 MB. Free memory was 232.3 MB in the beginning and 230.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1521.60 ms. Allocated memory was 307.8 MB in the beginning and 323.5 MB in the end (delta: 15.7 MB). Free memory was 230.2 MB in the beginning and 255.8 MB in the end (delta: -25.6 MB). Peak memory consumption was 49.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1040.76 ms. Allocated memory is still 323.5 MB. Free memory was 255.8 MB in the beginning and 196.5 MB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 51959.61 ms. Allocated memory was 323.5 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 195.0 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 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.8s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 37.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10995 SDtfs, 1469 SDslu, 25713 SDs, 0 SdLazy, 17122 SolverSat, 4186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2980occurred in iteration=12, 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.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 6741 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 2305 SizeOfPredicates, 9 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 25/27 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.48.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-37-35-271.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.48.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-37-35-271.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.48.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-37-35-271.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.48.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-37-35-271.csv Completed graceful shutdown