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/hopv/lia/mochi/a-init.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:12:28,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:12:28,205 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:12:28,216 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:12:28,216 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:12:28,217 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:12:28,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:12:28,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:12:28,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:12:28,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:12:28,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:12:28,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:12:28,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:12:28,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:12:28,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:12:28,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:12:28,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:12:28,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:12:28,235 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:12:28,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:12:28,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:12:28,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:12:28,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:12:28,240 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:12:28,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:12:28,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:12:28,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:12:28,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:12:28,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:12:28,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:12:28,245 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:12:28,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:12:28,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:12:28,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:12:28,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:12:28,247 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:12:28,261 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:12:28,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:12:28,262 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:12:28,262 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:12:28,263 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:12:28,263 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:12:28,263 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:12:28,264 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:12:28,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:12:28,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:12:28,264 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:12:28,265 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:12:28,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:12:28,265 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:12:28,265 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:12:28,266 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:12:28,266 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:12:28,266 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:12:28,266 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:12:28,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:12:28,267 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:12:28,268 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:12:28,268 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:12:28,316 INFO ]: Repository-Root is: /tmp [2018-06-24 21:12:28,335 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:12:28,341 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:12:28,342 INFO ]: Initializing SmtParser... [2018-06-24 21:12:28,342 INFO ]: SmtParser initialized [2018-06-24 21:12:28,343 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/a-init.smt2 [2018-06-24 21:12:28,344 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 21:12:28,434 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/a-init.smt2 unknown [2018-06-24 21:12:28,749 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/a-init.smt2 [2018-06-24 21:12:28,754 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:12:28,764 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:12:28,765 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:12:28,765 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:12:28,765 INFO ]: ChcToBoogie initialized [2018-06-24 21:12:28,769 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:12:28" (1/1) ... [2018-06-24 21:12:28,834 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:28 Unit [2018-06-24 21:12:28,834 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:12:28,835 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:12:28,835 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:12:28,835 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:12:28,861 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:28" (1/1) ... [2018-06-24 21:12:28,861 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:28" (1/1) ... [2018-06-24 21:12:28,869 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:28" (1/1) ... [2018-06-24 21:12:28,869 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:28" (1/1) ... [2018-06-24 21:12:28,878 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:28" (1/1) ... [2018-06-24 21:12:28,881 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:28" (1/1) ... [2018-06-24 21:12:28,883 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:28" (1/1) ... [2018-06-24 21:12:28,885 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:12:28,886 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:12:28,886 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:12:28,886 INFO ]: RCFGBuilder initialized [2018-06-24 21:12:28,887 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:28" (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 21:12:28,908 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:12:28,909 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:12:28,909 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:12:28,909 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:12:28,909 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:12:28,909 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 21:12:29,438 INFO ]: Using library mode [2018-06-24 21:12:29,438 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:12:29 BoogieIcfgContainer [2018-06-24 21:12:29,439 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:12:29,441 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:12:29,441 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:12:29,442 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:12:29,443 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:12:29" (1/1) ... [2018-06-24 21:12:29,461 INFO ]: Initial Icfg 37 locations, 55 edges [2018-06-24 21:12:29,463 INFO ]: Using Remove infeasible edges [2018-06-24 21:12:29,464 INFO ]: Using Maximize final states [2018-06-24 21:12:29,464 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:12:29,464 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:12:29,469 INFO ]: Using Remove sink states [2018-06-24 21:12:29,470 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:12:29,470 INFO ]: Using Use SBE [2018-06-24 21:12:29,503 WARN ]: expecting exponential blowup for input size 6 [2018-06-24 21:12:29,529 WARN ]: expecting exponential blowup for input size 7 [2018-06-24 21:12:29,592 WARN ]: expecting exponential blowup for input size 6 [2018-06-24 21:12:29,599 WARN ]: expecting exponential blowup for input size 7 [2018-06-24 21:12:29,620 INFO ]: SBE split 3 edges [2018-06-24 21:12:29,627 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:12:29,629 INFO ]: 0 new accepting states [2018-06-24 21:12:30,248 INFO ]: Removed 57 edges and 15 locations by large block encoding [2018-06-24 21:12:30,250 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:12:30,251 INFO ]: Removed 4 edges and 0 locations because of local infeasibility [2018-06-24 21:12:30,252 INFO ]: 0 new accepting states [2018-06-24 21:12:30,318 INFO ]: Removed 4 edges and 1 locations by large block encoding [2018-06-24 21:12:30,318 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:12:30,318 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:12:30,318 INFO ]: 0 new accepting states [2018-06-24 21:12:30,319 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:12:30,319 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:12:30,319 INFO ]: Encoded RCFG 19 locations, 42 edges [2018-06-24 21:12:30,319 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:12:30 BasicIcfg [2018-06-24 21:12:30,320 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:12:30,321 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:12:30,321 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:12:30,331 INFO ]: TraceAbstraction initialized [2018-06-24 21:12:30,331 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:12:28" (1/4) ... [2018-06-24 21:12:30,332 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390cfe8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:12:30, skipping insertion in model container [2018-06-24 21:12:30,332 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:12:28" (2/4) ... [2018-06-24 21:12:30,332 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390cfe8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:12:30, skipping insertion in model container [2018-06-24 21:12:30,333 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:12:29" (3/4) ... [2018-06-24 21:12:30,333 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390cfe8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:12:30, skipping insertion in model container [2018-06-24 21:12:30,333 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:12:30" (4/4) ... [2018-06-24 21:12:30,334 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:12:30,346 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:12:30,354 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:12:30,408 INFO ]: Using default assertion order modulation [2018-06-24 21:12:30,409 INFO ]: Interprodecural is true [2018-06-24 21:12:30,409 INFO ]: Hoare is false [2018-06-24 21:12:30,409 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:12:30,409 INFO ]: Backedges is TWOTRACK [2018-06-24 21:12:30,409 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:12:30,409 INFO ]: Difference is false [2018-06-24 21:12:30,409 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:12:30,409 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:12:30,424 INFO ]: Start isEmpty. Operand 19 states. [2018-06-24 21:12:30,439 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:12:30,439 INFO ]: Found error trace [2018-06-24 21:12:30,440 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:12:30,440 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:30,445 INFO ]: Analyzing trace with hash 44311505, now seen corresponding path program 1 times [2018-06-24 21:12:30,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:30,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:30,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:30,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:30,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:30,560 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:30,650 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:12:30,652 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:30,652 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:12:30,653 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:30,664 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:30,664 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:30,667 INFO ]: Start difference. First operand 19 states. Second operand 3 states. [2018-06-24 21:12:31,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:31,345 INFO ]: Finished difference Result 27 states and 66 transitions. [2018-06-24 21:12:31,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:31,347 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:12:31,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:31,360 INFO ]: With dead ends: 27 [2018-06-24 21:12:31,360 INFO ]: Without dead ends: 27 [2018-06-24 21:12:31,365 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 21:12:31,392 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 21:12:31,428 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 21:12:31,429 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 21:12:31,431 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 66 transitions. [2018-06-24 21:12:31,434 INFO ]: Start accepts. Automaton has 27 states and 66 transitions. Word has length 5 [2018-06-24 21:12:31,435 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:31,435 INFO ]: Abstraction has 27 states and 66 transitions. [2018-06-24 21:12:31,435 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:31,435 INFO ]: Start isEmpty. Operand 27 states and 66 transitions. [2018-06-24 21:12:31,439 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:12:31,439 INFO ]: Found error trace [2018-06-24 21:12:31,439 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:12:31,439 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:31,439 INFO ]: Analyzing trace with hash 1380139945, now seen corresponding path program 1 times [2018-06-24 21:12:31,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:31,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:31,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:31,440 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:31,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:31,465 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:31,631 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:12:31,631 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:31,631 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:12:31,632 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:12:31,632 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:12:31,632 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:12:31,632 INFO ]: Start difference. First operand 27 states and 66 transitions. Second operand 4 states. [2018-06-24 21:12:31,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:31,935 INFO ]: Finished difference Result 31 states and 74 transitions. [2018-06-24 21:12:31,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:12:31,936 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:12:31,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:31,937 INFO ]: With dead ends: 31 [2018-06-24 21:12:31,937 INFO ]: Without dead ends: 27 [2018-06-24 21:12:31,938 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:12:31,938 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 21:12:31,943 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 21:12:31,943 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 21:12:31,945 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 62 transitions. [2018-06-24 21:12:31,945 INFO ]: Start accepts. Automaton has 27 states and 62 transitions. Word has length 6 [2018-06-24 21:12:31,945 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:31,945 INFO ]: Abstraction has 27 states and 62 transitions. [2018-06-24 21:12:31,945 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:12:31,945 INFO ]: Start isEmpty. Operand 27 states and 62 transitions. [2018-06-24 21:12:31,947 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:12:31,947 INFO ]: Found error trace [2018-06-24 21:12:31,947 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:12:31,947 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:31,947 INFO ]: Analyzing trace with hash 1382910508, now seen corresponding path program 1 times [2018-06-24 21:12:31,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:31,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:31,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:31,948 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:31,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:31,961 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:32,024 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:12:32,024 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:32,024 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:12:32,025 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:32,025 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:32,025 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:32,025 INFO ]: Start difference. First operand 27 states and 62 transitions. Second operand 3 states. [2018-06-24 21:12:32,070 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:32,070 INFO ]: Finished difference Result 29 states and 64 transitions. [2018-06-24 21:12:32,070 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:32,070 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:12:32,070 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:32,072 INFO ]: With dead ends: 29 [2018-06-24 21:12:32,072 INFO ]: Without dead ends: 29 [2018-06-24 21:12:32,072 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 21:12:32,072 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:12:32,077 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 21:12:32,077 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:12:32,078 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 64 transitions. [2018-06-24 21:12:32,078 INFO ]: Start accepts. Automaton has 29 states and 64 transitions. Word has length 6 [2018-06-24 21:12:32,079 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:32,079 INFO ]: Abstraction has 29 states and 64 transitions. [2018-06-24 21:12:32,079 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:32,079 INFO ]: Start isEmpty. Operand 29 states and 64 transitions. [2018-06-24 21:12:32,080 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:12:32,080 INFO ]: Found error trace [2018-06-24 21:12:32,080 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:32,081 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:32,081 INFO ]: Analyzing trace with hash -81394775, now seen corresponding path program 1 times [2018-06-24 21:12:32,081 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:32,081 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:32,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:32,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:32,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:32,097 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:32,188 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:12:32,188 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:32,188 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:12:32,188 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:12:32,188 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:12:32,188 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:12:32,189 INFO ]: Start difference. First operand 29 states and 64 transitions. Second operand 4 states. [2018-06-24 21:12:32,283 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:32,283 INFO ]: Finished difference Result 35 states and 72 transitions. [2018-06-24 21:12:32,283 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:12:32,283 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:12:32,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:32,285 INFO ]: With dead ends: 35 [2018-06-24 21:12:32,285 INFO ]: Without dead ends: 31 [2018-06-24 21:12:32,285 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:12:32,285 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 21:12:32,290 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 21:12:32,290 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 21:12:32,291 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 66 transitions. [2018-06-24 21:12:32,291 INFO ]: Start accepts. Automaton has 31 states and 66 transitions. Word has length 7 [2018-06-24 21:12:32,291 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:32,291 INFO ]: Abstraction has 31 states and 66 transitions. [2018-06-24 21:12:32,291 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:12:32,291 INFO ]: Start isEmpty. Operand 31 states and 66 transitions. [2018-06-24 21:12:32,293 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:12:32,293 INFO ]: Found error trace [2018-06-24 21:12:32,293 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:32,293 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:32,293 INFO ]: Analyzing trace with hash 119009282, now seen corresponding path program 1 times [2018-06-24 21:12:32,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:32,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:32,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:32,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:32,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:32,304 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:32,370 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:12:32,370 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:32,370 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:12:32,370 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:32,370 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:32,370 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:32,370 INFO ]: Start difference. First operand 31 states and 66 transitions. Second operand 3 states. [2018-06-24 21:12:32,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:32,560 INFO ]: Finished difference Result 41 states and 92 transitions. [2018-06-24 21:12:32,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:32,561 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:12:32,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:32,563 INFO ]: With dead ends: 41 [2018-06-24 21:12:32,563 INFO ]: Without dead ends: 41 [2018-06-24 21:12:32,563 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 21:12:32,563 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 21:12:32,576 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 21:12:32,576 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 21:12:32,577 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 92 transitions. [2018-06-24 21:12:32,578 INFO ]: Start accepts. Automaton has 41 states and 92 transitions. Word has length 7 [2018-06-24 21:12:32,578 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:32,578 INFO ]: Abstraction has 41 states and 92 transitions. [2018-06-24 21:12:32,578 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:32,578 INFO ]: Start isEmpty. Operand 41 states and 92 transitions. [2018-06-24 21:12:32,579 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:12:32,579 INFO ]: Found error trace [2018-06-24 21:12:32,579 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:32,579 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:32,580 INFO ]: Analyzing trace with hash 370052747, now seen corresponding path program 1 times [2018-06-24 21:12:32,580 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:32,580 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:32,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:32,580 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:32,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:32,625 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:32,803 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:12:32,803 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:32,803 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:12:32,803 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:12:32,803 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:12:32,803 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:12:32,803 INFO ]: Start difference. First operand 41 states and 92 transitions. Second operand 4 states. [2018-06-24 21:12:32,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:32,986 INFO ]: Finished difference Result 48 states and 100 transitions. [2018-06-24 21:12:32,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:12:32,987 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-24 21:12:32,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:32,988 INFO ]: With dead ends: 48 [2018-06-24 21:12:32,988 INFO ]: Without dead ends: 36 [2018-06-24 21:12:32,988 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:12:32,988 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 21:12:32,996 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 21:12:32,996 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 21:12:32,997 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 75 transitions. [2018-06-24 21:12:32,997 INFO ]: Start accepts. Automaton has 36 states and 75 transitions. Word has length 8 [2018-06-24 21:12:32,997 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:32,997 INFO ]: Abstraction has 36 states and 75 transitions. [2018-06-24 21:12:32,997 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:12:32,997 INFO ]: Start isEmpty. Operand 36 states and 75 transitions. [2018-06-24 21:12:32,998 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:12:32,998 INFO ]: Found error trace [2018-06-24 21:12:32,998 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:32,998 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:32,998 INFO ]: Analyzing trace with hash -813660004, now seen corresponding path program 1 times [2018-06-24 21:12:32,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:32,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:32,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:32,999 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:32,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:33,036 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:33,141 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:12:33,141 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:33,141 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:12:33,141 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:33,141 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:33,141 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:33,141 INFO ]: Start difference. First operand 36 states and 75 transitions. Second operand 3 states. [2018-06-24 21:12:33,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:33,287 INFO ]: Finished difference Result 43 states and 74 transitions. [2018-06-24 21:12:33,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:33,288 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-24 21:12:33,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:33,289 INFO ]: With dead ends: 43 [2018-06-24 21:12:33,289 INFO ]: Without dead ends: 43 [2018-06-24 21:12:33,289 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 21:12:33,290 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 21:12:33,295 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-24 21:12:33,295 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 21:12:33,301 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2018-06-24 21:12:33,301 INFO ]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 15 [2018-06-24 21:12:33,301 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:33,301 INFO ]: Abstraction has 43 states and 74 transitions. [2018-06-24 21:12:33,301 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:33,301 INFO ]: Start isEmpty. Operand 43 states and 74 transitions. [2018-06-24 21:12:33,303 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:12:33,303 INFO ]: Found error trace [2018-06-24 21:12:33,303 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:33,303 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:33,303 INFO ]: Analyzing trace with hash 396488882, now seen corresponding path program 1 times [2018-06-24 21:12:33,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:33,303 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:33,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:33,304 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:33,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:33,323 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:33,369 INFO ]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:12:33,369 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:33,369 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:12:33,369 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:12:33,369 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:12:33,369 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:12:33,369 INFO ]: Start difference. First operand 43 states and 74 transitions. Second operand 4 states. [2018-06-24 21:12:33,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:33,408 INFO ]: Finished difference Result 53 states and 100 transitions. [2018-06-24 21:12:33,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:12:33,409 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-24 21:12:33,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:33,411 INFO ]: With dead ends: 53 [2018-06-24 21:12:33,411 INFO ]: Without dead ends: 53 [2018-06-24 21:12:33,411 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:12:33,411 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 21:12:33,421 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 47. [2018-06-24 21:12:33,421 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 21:12:33,422 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2018-06-24 21:12:33,422 INFO ]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 17 [2018-06-24 21:12:33,422 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:33,422 INFO ]: Abstraction has 47 states and 82 transitions. [2018-06-24 21:12:33,422 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:12:33,422 INFO ]: Start isEmpty. Operand 47 states and 82 transitions. [2018-06-24 21:12:33,424 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:12:33,424 INFO ]: Found error trace [2018-06-24 21:12:33,424 INFO ]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:33,424 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:33,424 INFO ]: Analyzing trace with hash 1171373429, now seen corresponding path program 1 times [2018-06-24 21:12:33,424 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:33,424 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:33,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:33,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:33,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:33,445 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:33,575 INFO ]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 21:12:33,575 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:33,575 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:12:33,575 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:12:33,575 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:12:33,575 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:12:33,575 INFO ]: Start difference. First operand 47 states and 82 transitions. Second operand 5 states. [2018-06-24 21:12:33,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:33,729 INFO ]: Finished difference Result 67 states and 136 transitions. [2018-06-24 21:12:33,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:12:33,729 INFO ]: Start accepts. Automaton has 5 states. Word has length 24 [2018-06-24 21:12:33,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:33,731 INFO ]: With dead ends: 67 [2018-06-24 21:12:33,731 INFO ]: Without dead ends: 67 [2018-06-24 21:12:33,731 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:12:33,731 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 21:12:33,741 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 51. [2018-06-24 21:12:33,741 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 21:12:33,742 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2018-06-24 21:12:33,742 INFO ]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 24 [2018-06-24 21:12:33,743 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:33,743 INFO ]: Abstraction has 51 states and 90 transitions. [2018-06-24 21:12:33,743 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:12:33,743 INFO ]: Start isEmpty. Operand 51 states and 90 transitions. [2018-06-24 21:12:33,744 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:12:33,744 INFO ]: Found error trace [2018-06-24 21:12:33,744 INFO ]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:33,745 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:33,745 INFO ]: Analyzing trace with hash -1322858710, now seen corresponding path program 1 times [2018-06-24 21:12:33,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:33,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:33,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:33,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:33,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:33,780 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:33,858 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 21:12:33,858 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:33,858 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:12:33,858 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:33,859 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:33,862 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:33,862 INFO ]: Start difference. First operand 51 states and 90 transitions. Second operand 3 states. [2018-06-24 21:12:34,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:34,177 INFO ]: Finished difference Result 66 states and 114 transitions. [2018-06-24 21:12:34,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:34,177 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-24 21:12:34,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:34,178 INFO ]: With dead ends: 66 [2018-06-24 21:12:34,178 INFO ]: Without dead ends: 66 [2018-06-24 21:12:34,178 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 21:12:34,178 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-24 21:12:34,186 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-24 21:12:34,186 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 21:12:34,187 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 114 transitions. [2018-06-24 21:12:34,187 INFO ]: Start accepts. Automaton has 66 states and 114 transitions. Word has length 24 [2018-06-24 21:12:34,187 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:34,187 INFO ]: Abstraction has 66 states and 114 transitions. [2018-06-24 21:12:34,187 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:34,187 INFO ]: Start isEmpty. Operand 66 states and 114 transitions. [2018-06-24 21:12:34,189 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 21:12:34,189 INFO ]: Found error trace [2018-06-24 21:12:34,189 INFO ]: trace histogram [5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:34,189 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:34,189 INFO ]: Analyzing trace with hash 1163082475, now seen corresponding path program 1 times [2018-06-24 21:12:34,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:34,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:34,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:34,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:34,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:34,208 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:34,272 INFO ]: Checked inductivity of 51 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 21:12:34,272 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:34,272 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 21:12:34,272 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:12:34,272 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:12:34,272 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:12:34,273 INFO ]: Start difference. First operand 66 states and 114 transitions. Second operand 6 states. [2018-06-24 21:12:34,430 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:34,430 INFO ]: Finished difference Result 85 states and 156 transitions. [2018-06-24 21:12:34,431 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:12:34,431 INFO ]: Start accepts. Automaton has 6 states. Word has length 31 [2018-06-24 21:12:34,431 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:34,432 INFO ]: With dead ends: 85 [2018-06-24 21:12:34,432 INFO ]: Without dead ends: 85 [2018-06-24 21:12:34,433 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:12:34,433 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-24 21:12:34,443 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 67. [2018-06-24 21:12:34,443 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-24 21:12:34,444 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2018-06-24 21:12:34,444 INFO ]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 31 [2018-06-24 21:12:34,444 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:34,444 INFO ]: Abstraction has 67 states and 115 transitions. [2018-06-24 21:12:34,444 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:12:34,444 INFO ]: Start isEmpty. Operand 67 states and 115 transitions. [2018-06-24 21:12:34,446 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 21:12:34,446 INFO ]: Found error trace [2018-06-24 21:12:34,446 INFO ]: trace histogram [6, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:34,446 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:34,446 INFO ]: Analyzing trace with hash -528827331, now seen corresponding path program 1 times [2018-06-24 21:12:34,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:34,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:34,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:34,447 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:34,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:34,466 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:34,571 INFO ]: Checked inductivity of 83 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-24 21:12:34,571 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:34,571 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:12:34,571 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:12:34,572 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:12:34,572 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:12:34,572 INFO ]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2018-06-24 21:12:34,653 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:34,653 INFO ]: Finished difference Result 75 states and 127 transitions. [2018-06-24 21:12:34,654 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:12:34,654 INFO ]: Start accepts. Automaton has 3 states. Word has length 38 [2018-06-24 21:12:34,654 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:34,655 INFO ]: With dead ends: 75 [2018-06-24 21:12:34,655 INFO ]: Without dead ends: 75 [2018-06-24 21:12:34,655 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 21:12:34,656 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-24 21:12:34,661 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-06-24 21:12:34,661 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-24 21:12:34,663 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 127 transitions. [2018-06-24 21:12:34,663 INFO ]: Start accepts. Automaton has 75 states and 127 transitions. Word has length 38 [2018-06-24 21:12:34,663 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:34,663 INFO ]: Abstraction has 75 states and 127 transitions. [2018-06-24 21:12:34,663 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:12:34,663 INFO ]: Start isEmpty. Operand 75 states and 127 transitions. [2018-06-24 21:12:34,665 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-24 21:12:34,665 INFO ]: Found error trace [2018-06-24 21:12:34,665 INFO ]: trace histogram [7, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:12:34,665 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:12:34,666 INFO ]: Analyzing trace with hash -1271415773, now seen corresponding path program 1 times [2018-06-24 21:12:34,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:12:34,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:12:34,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:34,669 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:12:34,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:12:34,714 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:12:34,985 INFO ]: Checked inductivity of 120 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-24 21:12:34,985 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:12:34,985 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-24 21:12:34,985 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:12:34,985 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:12:34,985 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:12:34,985 INFO ]: Start difference. First operand 75 states and 127 transitions. Second operand 7 states. [2018-06-24 21:12:35,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:12:35,150 INFO ]: Finished difference Result 65 states and 111 transitions. [2018-06-24 21:12:35,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:12:35,150 INFO ]: Start accepts. Automaton has 7 states. Word has length 45 [2018-06-24 21:12:35,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:12:35,151 INFO ]: With dead ends: 65 [2018-06-24 21:12:35,151 INFO ]: Without dead ends: 0 [2018-06-24 21:12:35,151 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:12:35,151 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:12:35,151 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:12:35,151 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:12:35,151 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:12:35,151 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-06-24 21:12:35,151 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:12:35,151 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:12:35,151 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:12:35,151 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:12:35,151 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:12:35,153 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:12:35,154 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:12:35 BasicIcfg [2018-06-24 21:12:35,154 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:12:35,154 INFO ]: Toolchain (without parser) took 6400.02 ms. Allocated memory was 309.3 MB in the beginning and 344.5 MB in the end (delta: 35.1 MB). Free memory was 257.7 MB in the beginning and 221.7 MB in the end (delta: 36.0 MB). Peak memory consumption was 71.2 MB. Max. memory is 3.6 GB. [2018-06-24 21:12:35,156 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:12:35,156 INFO ]: ChcToBoogie took 69.64 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 253.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:12:35,157 INFO ]: Boogie Preprocessor took 50.28 ms. Allocated memory is still 309.3 MB. Free memory is still 253.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:12:35,157 INFO ]: RCFGBuilder took 552.75 ms. Allocated memory is still 309.3 MB. Free memory was 253.7 MB in the beginning and 233.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:12:35,157 INFO ]: BlockEncodingV2 took 878.56 ms. Allocated memory is still 309.3 MB. Free memory was 233.8 MB in the beginning and 197.8 MB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 3.6 GB. [2018-06-24 21:12:35,158 INFO ]: TraceAbstraction took 4832.97 ms. Allocated memory was 309.3 MB in the beginning and 344.5 MB in the end (delta: 35.1 MB). Free memory was 197.8 MB in the beginning and 221.7 MB in the end (delta: -23.9 MB). Peak memory consumption was 11.3 MB. Max. memory is 3.6 GB. [2018-06-24 21:12:35,161 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 37 locations, 55 edges - StatisticsResult: Encoded RCFG 19 locations, 42 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.64 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 253.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 50.28 ms. Allocated memory is still 309.3 MB. Free memory is still 253.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 552.75 ms. Allocated memory is still 309.3 MB. Free memory was 253.7 MB in the beginning and 233.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 878.56 ms. Allocated memory is still 309.3 MB. Free memory was 233.8 MB in the beginning and 197.8 MB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4832.97 ms. Allocated memory was 309.3 MB in the beginning and 344.5 MB in the end (delta: 35.1 MB). Free memory was 197.8 MB in the beginning and 221.7 MB in the end (delta: -23.9 MB). Peak memory consumption was 11.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. SAFE Result, 4.7s OverallTime, 13 OverallIterations, 7 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 553 SDtfs, 109 SDslu, 653 SDs, 0 SdLazy, 495 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred 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: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 40 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 11356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 335/335 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-12-35-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-12-35-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-12-35-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-12-35-171.csv Received shutdown request...