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/vmt-chc-benchmarks/cav12/s3_srvr_2.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:46:37,260 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:46:37,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:46:37,276 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:46:37,276 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:46:37,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:46:37,278 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:46:37,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:46:37,282 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:46:37,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:46:37,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:46:37,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:46:37,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:46:37,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:46:37,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:46:37,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:46:37,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:46:37,296 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:46:37,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:46:37,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:46:37,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:46:37,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:46:37,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:46:37,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:46:37,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:46:37,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:46:37,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:46:37,306 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:46:37,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:46:37,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:46:37,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:46:37,309 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:46:37,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:46:37,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:46:37,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:46:37,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:46:37,311 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:46:37,330 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:46:37,331 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:46:37,331 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:46:37,331 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:46:37,332 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:46:37,332 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:46:37,333 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:46:37,333 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:46:37,333 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:46:37,333 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:46:37,333 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:46:37,334 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:46:37,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:46:37,334 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:46:37,334 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:46:37,334 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:46:37,335 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:46:37,335 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:46:37,335 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:46:37,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:46:37,335 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:46:37,339 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:46:37,340 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:46:37,394 INFO ]: Repository-Root is: /tmp [2018-06-26 20:46:37,407 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:46:37,413 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:46:37,414 INFO ]: Initializing SmtParser... [2018-06-26 20:46:37,414 INFO ]: SmtParser initialized [2018-06-26 20:46:37,415 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_2.cil.smt2 [2018-06-26 20:46:37,416 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 20:46:37,504 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_2.cil.smt2 unknown [2018-06-26 20:46:38,000 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_2.cil.smt2 [2018-06-26 20:46:38,005 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:46:38,010 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:46:38,011 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:46:38,011 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:46:38,011 INFO ]: ChcToBoogie initialized [2018-06-26 20:46:38,014 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:46:38" (1/1) ... [2018-06-26 20:46:38,096 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:46:38 Unit [2018-06-26 20:46:38,096 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:46:38,099 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:46:38,099 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:46:38,099 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:46:38,113 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:46:38" (1/1) ... [2018-06-26 20:46:38,113 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:46:38" (1/1) ... [2018-06-26 20:46:38,121 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:46:38" (1/1) ... [2018-06-26 20:46:38,121 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:46:38" (1/1) ... [2018-06-26 20:46:38,140 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:46:38" (1/1) ... [2018-06-26 20:46:38,141 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:46:38" (1/1) ... [2018-06-26 20:46:38,146 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:46:38" (1/1) ... [2018-06-26 20:46:38,151 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:46:38,152 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:46:38,152 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:46:38,152 INFO ]: RCFGBuilder initialized [2018-06-26 20:46:38,153 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:46:38" (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-26 20:46:38,168 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:46:38,168 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:46:38,168 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:46:38,168 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:46:38,168 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:46:38,168 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 20:46:38,585 INFO ]: Using library mode [2018-06-26 20:46:38,585 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:46:38 BoogieIcfgContainer [2018-06-26 20:46:38,585 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:46:38,588 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:46:38,588 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:46:38,589 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:46:38,590 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:46:38" (1/1) ... [2018-06-26 20:46:38,608 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:46:38,609 INFO ]: Using Remove infeasible edges [2018-06-26 20:46:38,610 INFO ]: Using Maximize final states [2018-06-26 20:46:38,610 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:46:38,610 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:46:38,619 INFO ]: Using Remove sink states [2018-06-26 20:46:38,620 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:46:38,620 INFO ]: Using Use SBE [2018-06-26 20:46:40,108 INFO ]: SBE split 1 edges [2018-06-26 20:46:40,208 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:46:40,210 INFO ]: 0 new accepting states [2018-06-26 20:46:40,264 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:46:40,266 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:46:40,367 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:46:40,367 INFO ]: 0 new accepting states [2018-06-26 20:46:40,369 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:46:40,369 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:46:40,480 INFO ]: Encoded RCFG 6 locations, 884 edges [2018-06-26 20:46:40,480 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:46:40 BasicIcfg [2018-06-26 20:46:40,480 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:46:40,482 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:46:40,482 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:46:40,485 INFO ]: TraceAbstraction initialized [2018-06-26 20:46:40,485 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:46:38" (1/4) ... [2018-06-26 20:46:40,487 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f44de39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:46:40, skipping insertion in model container [2018-06-26 20:46:40,487 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:46:38" (2/4) ... [2018-06-26 20:46:40,487 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f44de39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:46:40, skipping insertion in model container [2018-06-26 20:46:40,487 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:46:38" (3/4) ... [2018-06-26 20:46:40,487 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f44de39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:46:40, skipping insertion in model container [2018-06-26 20:46:40,487 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:46:40" (4/4) ... [2018-06-26 20:46:40,489 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:46:40,498 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:46:40,504 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:46:40,542 INFO ]: Using default assertion order modulation [2018-06-26 20:46:40,542 INFO ]: Interprodecural is true [2018-06-26 20:46:40,542 INFO ]: Hoare is false [2018-06-26 20:46:40,542 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:46:40,542 INFO ]: Backedges is TWOTRACK [2018-06-26 20:46:40,542 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:46:40,543 INFO ]: Difference is false [2018-06-26 20:46:40,543 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:46:40,543 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:46:40,562 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:46:40,581 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:46:40,581 INFO ]: Found error trace [2018-06-26 20:46:40,582 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:46:40,582 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:46:40,587 INFO ]: Analyzing trace with hash 62433570, now seen corresponding path program 1 times [2018-06-26 20:46:40,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:46:40,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:46:40,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:40,620 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:46:40,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:40,680 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:46:40,817 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:46:40,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:46:40,820 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:46:40,822 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:46:40,837 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:46:40,837 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:46:40,840 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:46:46,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:46:46,867 INFO ]: Finished difference Result 7 states and 981 transitions. [2018-06-26 20:46:46,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:46:46,868 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:46:46,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:46:46,883 INFO ]: With dead ends: 7 [2018-06-26 20:46:46,883 INFO ]: Without dead ends: 7 [2018-06-26 20:46:46,885 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:46:46,916 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:46:46,961 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:46:46,963 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:46:46,966 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 981 transitions. [2018-06-26 20:46:46,967 INFO ]: Start accepts. Automaton has 7 states and 981 transitions. Word has length 5 [2018-06-26 20:46:46,968 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:46:46,968 INFO ]: Abstraction has 7 states and 981 transitions. [2018-06-26 20:46:46,968 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:46:46,968 INFO ]: Start isEmpty. Operand 7 states and 981 transitions. [2018-06-26 20:46:46,969 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:46:46,970 INFO ]: Found error trace [2018-06-26 20:46:46,970 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:46:46,970 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:46:46,970 INFO ]: Analyzing trace with hash 1915910426, now seen corresponding path program 1 times [2018-06-26 20:46:46,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:46:46,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:46:46,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:46,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:46:46,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:47,040 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:46:47,129 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:46:47,129 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:46:47,129 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:46:47,130 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:46:47,130 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:46:47,131 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:46:47,131 INFO ]: Start difference. First operand 7 states and 981 transitions. Second operand 3 states. [2018-06-26 20:46:49,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:46:49,820 INFO ]: Finished difference Result 8 states and 983 transitions. [2018-06-26 20:46:49,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:46:49,820 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:46:49,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:46:49,821 INFO ]: With dead ends: 8 [2018-06-26 20:46:49,821 INFO ]: Without dead ends: 8 [2018-06-26 20:46:49,822 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:46:49,822 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:46:49,831 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:46:49,831 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:46:49,834 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 983 transitions. [2018-06-26 20:46:49,835 INFO ]: Start accepts. Automaton has 8 states and 983 transitions. Word has length 6 [2018-06-26 20:46:49,835 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:46:49,835 INFO ]: Abstraction has 8 states and 983 transitions. [2018-06-26 20:46:49,835 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:46:49,835 INFO ]: Start isEmpty. Operand 8 states and 983 transitions. [2018-06-26 20:46:49,835 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:46:49,835 INFO ]: Found error trace [2018-06-26 20:46:49,835 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:46:49,835 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:46:49,835 INFO ]: Analyzing trace with hash 1918263915, now seen corresponding path program 1 times [2018-06-26 20:46:49,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:46:49,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:46:49,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:49,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:46:49,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:49,869 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:46:49,919 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:46:49,919 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:46:49,919 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:46:49,919 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:46:49,920 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:46:49,920 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:46:49,920 INFO ]: Start difference. First operand 8 states and 983 transitions. Second operand 3 states. [2018-06-26 20:46:52,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:46:52,797 INFO ]: Finished difference Result 9 states and 985 transitions. [2018-06-26 20:46:52,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:46:52,798 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:46:52,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:46:52,800 INFO ]: With dead ends: 9 [2018-06-26 20:46:52,800 INFO ]: Without dead ends: 9 [2018-06-26 20:46:52,800 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:46:52,800 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:46:52,806 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:46:52,806 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:46:52,808 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 985 transitions. [2018-06-26 20:46:52,808 INFO ]: Start accepts. Automaton has 9 states and 985 transitions. Word has length 6 [2018-06-26 20:46:52,808 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:46:52,808 INFO ]: Abstraction has 9 states and 985 transitions. [2018-06-26 20:46:52,808 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:46:52,808 INFO ]: Start isEmpty. Operand 9 states and 985 transitions. [2018-06-26 20:46:52,810 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:46:52,810 INFO ]: Found error trace [2018-06-26 20:46:52,810 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:46:52,810 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:46:52,810 INFO ]: Analyzing trace with hash 605222789, now seen corresponding path program 1 times [2018-06-26 20:46:52,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:46:52,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:46:52,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:52,811 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:46:52,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:52,868 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:46:52,940 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:46:52,941 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:46:52,941 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:46:52,941 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:46:52,941 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:46:52,941 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:46:52,941 INFO ]: Start difference. First operand 9 states and 985 transitions. Second operand 3 states. [2018-06-26 20:46:55,632 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:46:55,632 INFO ]: Finished difference Result 11 states and 1000 transitions. [2018-06-26 20:46:55,632 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:46:55,632 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:46:55,632 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:46:55,634 INFO ]: With dead ends: 11 [2018-06-26 20:46:55,634 INFO ]: Without dead ends: 11 [2018-06-26 20:46:55,634 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:46:55,634 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:46:55,639 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 20:46:55,639 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 20:46:55,641 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1000 transitions. [2018-06-26 20:46:55,641 INFO ]: Start accepts. Automaton has 11 states and 1000 transitions. Word has length 8 [2018-06-26 20:46:55,641 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:46:55,641 INFO ]: Abstraction has 11 states and 1000 transitions. [2018-06-26 20:46:55,641 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:46:55,641 INFO ]: Start isEmpty. Operand 11 states and 1000 transitions. [2018-06-26 20:46:55,642 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:46:55,642 INFO ]: Found error trace [2018-06-26 20:46:55,642 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:46:55,642 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:46:55,642 INFO ]: Analyzing trace with hash 179479608, now seen corresponding path program 1 times [2018-06-26 20:46:55,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:46:55,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:46:55,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:55,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:46:55,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:55,683 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:46:55,776 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:46:55,777 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:46:55,777 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:46:55,777 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:46:55,777 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:46:55,777 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:46:55,777 INFO ]: Start difference. First operand 11 states and 1000 transitions. Second operand 3 states. [2018-06-26 20:46:58,032 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:46:58,032 INFO ]: Finished difference Result 13 states and 1040 transitions. [2018-06-26 20:46:58,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:46:58,033 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:46:58,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:46:58,035 INFO ]: With dead ends: 13 [2018-06-26 20:46:58,035 INFO ]: Without dead ends: 13 [2018-06-26 20:46:58,035 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:46:58,035 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:46:58,046 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 20:46:58,046 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:46:58,048 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1038 transitions. [2018-06-26 20:46:58,048 INFO ]: Start accepts. Automaton has 12 states and 1038 transitions. Word has length 8 [2018-06-26 20:46:58,049 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:46:58,049 INFO ]: Abstraction has 12 states and 1038 transitions. [2018-06-26 20:46:58,049 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:46:58,049 INFO ]: Start isEmpty. Operand 12 states and 1038 transitions. [2018-06-26 20:46:58,049 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:46:58,049 INFO ]: Found error trace [2018-06-26 20:46:58,049 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:46:58,050 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:46:58,050 INFO ]: Analyzing trace with hash 1788769676, now seen corresponding path program 1 times [2018-06-26 20:46:58,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:46:58,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:46:58,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:58,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:46:58,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:46:58,099 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:46:58,208 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:46:58,209 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:46:58,209 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:46:58,209 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:46:58,209 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:46:58,209 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:46:58,209 INFO ]: Start difference. First operand 12 states and 1038 transitions. Second operand 3 states. [2018-06-26 20:47:00,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:00,419 INFO ]: Finished difference Result 14 states and 1170 transitions. [2018-06-26 20:47:00,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:00,419 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:47:00,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:00,421 INFO ]: With dead ends: 14 [2018-06-26 20:47:00,421 INFO ]: Without dead ends: 13 [2018-06-26 20:47:00,421 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:00,421 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:47:00,427 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:47:00,428 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:47:00,429 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1169 transitions. [2018-06-26 20:47:00,429 INFO ]: Start accepts. Automaton has 13 states and 1169 transitions. Word has length 9 [2018-06-26 20:47:00,429 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:00,429 INFO ]: Abstraction has 13 states and 1169 transitions. [2018-06-26 20:47:00,429 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:00,429 INFO ]: Start isEmpty. Operand 13 states and 1169 transitions. [2018-06-26 20:47:00,430 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:47:00,430 INFO ]: Found error trace [2018-06-26 20:47:00,430 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:00,430 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:00,430 INFO ]: Analyzing trace with hash 1650178422, now seen corresponding path program 1 times [2018-06-26 20:47:00,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:00,430 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:00,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:00,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:00,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:00,468 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:00,573 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:47:00,573 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:00,573 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:00,573 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:00,573 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:00,573 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:00,573 INFO ]: Start difference. First operand 13 states and 1169 transitions. Second operand 3 states. [2018-06-26 20:47:03,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:03,073 INFO ]: Finished difference Result 19 states and 1818 transitions. [2018-06-26 20:47:03,074 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:03,074 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:47:03,074 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:03,077 INFO ]: With dead ends: 19 [2018-06-26 20:47:03,077 INFO ]: Without dead ends: 19 [2018-06-26 20:47:03,077 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:03,077 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 20:47:03,094 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-26 20:47:03,095 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:47:03,097 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1815 transitions. [2018-06-26 20:47:03,097 INFO ]: Start accepts. Automaton has 17 states and 1815 transitions. Word has length 9 [2018-06-26 20:47:03,098 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:03,098 INFO ]: Abstraction has 17 states and 1815 transitions. [2018-06-26 20:47:03,098 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:03,098 INFO ]: Start isEmpty. Operand 17 states and 1815 transitions. [2018-06-26 20:47:03,099 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:47:03,099 INFO ]: Found error trace [2018-06-26 20:47:03,099 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:03,099 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:03,099 INFO ]: Analyzing trace with hash 1485791684, now seen corresponding path program 1 times [2018-06-26 20:47:03,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:03,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:03,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:03,100 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:03,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:03,131 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:03,217 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:47:03,217 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:03,217 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:03,217 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:03,217 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:03,217 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:03,217 INFO ]: Start difference. First operand 17 states and 1815 transitions. Second operand 3 states. [2018-06-26 20:47:05,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:05,498 INFO ]: Finished difference Result 20 states and 1881 transitions. [2018-06-26 20:47:05,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:05,498 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:47:05,498 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:05,500 INFO ]: With dead ends: 20 [2018-06-26 20:47:05,500 INFO ]: Without dead ends: 20 [2018-06-26 20:47:05,501 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:05,501 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 20:47:05,510 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-06-26 20:47:05,510 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:47:05,513 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1815 transitions. [2018-06-26 20:47:05,513 INFO ]: Start accepts. Automaton has 17 states and 1815 transitions. Word has length 9 [2018-06-26 20:47:05,513 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:05,513 INFO ]: Abstraction has 17 states and 1815 transitions. [2018-06-26 20:47:05,513 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:05,513 INFO ]: Start isEmpty. Operand 17 states and 1815 transitions. [2018-06-26 20:47:05,514 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:47:05,514 INFO ]: Found error trace [2018-06-26 20:47:05,514 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:05,514 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:05,514 INFO ]: Analyzing trace with hash 1320481425, now seen corresponding path program 1 times [2018-06-26 20:47:05,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:05,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:05,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:05,515 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:05,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:05,539 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:05,615 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:47:05,615 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:05,615 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:05,615 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:05,615 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:05,615 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:05,615 INFO ]: Start difference. First operand 17 states and 1815 transitions. Second operand 3 states. [2018-06-26 20:47:08,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:08,266 INFO ]: Finished difference Result 20 states and 1977 transitions. [2018-06-26 20:47:08,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:08,267 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:47:08,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:08,269 INFO ]: With dead ends: 20 [2018-06-26 20:47:08,269 INFO ]: Without dead ends: 20 [2018-06-26 20:47:08,269 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:08,270 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 20:47:08,280 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-26 20:47:08,280 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 20:47:08,284 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1975 transitions. [2018-06-26 20:47:08,284 INFO ]: Start accepts. Automaton has 19 states and 1975 transitions. Word has length 9 [2018-06-26 20:47:08,284 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:08,284 INFO ]: Abstraction has 19 states and 1975 transitions. [2018-06-26 20:47:08,284 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:08,284 INFO ]: Start isEmpty. Operand 19 states and 1975 transitions. [2018-06-26 20:47:08,285 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:47:08,286 INFO ]: Found error trace [2018-06-26 20:47:08,286 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:08,286 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:08,286 INFO ]: Analyzing trace with hash -355145565, now seen corresponding path program 1 times [2018-06-26 20:47:08,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:08,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:08,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:08,286 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:08,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:08,321 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:08,405 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:47:08,405 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:08,405 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:08,406 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:08,406 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:08,406 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:08,406 INFO ]: Start difference. First operand 19 states and 1975 transitions. Second operand 3 states. [2018-06-26 20:47:10,559 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:10,559 INFO ]: Finished difference Result 22 states and 2137 transitions. [2018-06-26 20:47:10,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:10,561 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:47:10,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:10,564 INFO ]: With dead ends: 22 [2018-06-26 20:47:10,564 INFO ]: Without dead ends: 22 [2018-06-26 20:47:10,564 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:10,564 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 20:47:10,576 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-06-26 20:47:10,576 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 20:47:10,580 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1975 transitions. [2018-06-26 20:47:10,580 INFO ]: Start accepts. Automaton has 19 states and 1975 transitions. Word has length 10 [2018-06-26 20:47:10,580 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:10,580 INFO ]: Abstraction has 19 states and 1975 transitions. [2018-06-26 20:47:10,580 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:10,580 INFO ]: Start isEmpty. Operand 19 states and 1975 transitions. [2018-06-26 20:47:10,581 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:47:10,581 INFO ]: Found error trace [2018-06-26 20:47:10,581 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:10,582 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:10,582 INFO ]: Analyzing trace with hash -117800668, now seen corresponding path program 1 times [2018-06-26 20:47:10,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:10,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:10,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:10,583 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:10,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:10,616 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:10,718 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:47:10,718 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:10,718 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:10,718 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:10,718 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:10,718 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:10,718 INFO ]: Start difference. First operand 19 states and 1975 transitions. Second operand 3 states. [2018-06-26 20:47:12,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:12,760 INFO ]: Finished difference Result 22 states and 2377 transitions. [2018-06-26 20:47:12,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:12,760 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:47:12,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:12,763 INFO ]: With dead ends: 22 [2018-06-26 20:47:12,763 INFO ]: Without dead ends: 22 [2018-06-26 20:47:12,764 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:12,764 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 20:47:12,770 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-26 20:47:12,770 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 20:47:12,772 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2375 transitions. [2018-06-26 20:47:12,772 INFO ]: Start accepts. Automaton has 21 states and 2375 transitions. Word has length 10 [2018-06-26 20:47:12,772 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:12,772 INFO ]: Abstraction has 21 states and 2375 transitions. [2018-06-26 20:47:12,772 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:12,772 INFO ]: Start isEmpty. Operand 21 states and 2375 transitions. [2018-06-26 20:47:12,774 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:47:12,774 INFO ]: Found error trace [2018-06-26 20:47:12,774 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:12,774 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:12,774 INFO ]: Analyzing trace with hash -336675145, now seen corresponding path program 1 times [2018-06-26 20:47:12,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:12,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:12,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:12,775 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:12,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:12,808 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:12,890 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:47:12,890 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:12,890 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:12,890 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:12,890 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:12,890 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:12,891 INFO ]: Start difference. First operand 21 states and 2375 transitions. Second operand 3 states. [2018-06-26 20:47:14,979 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:14,979 INFO ]: Finished difference Result 24 states and 2953 transitions. [2018-06-26 20:47:14,979 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:14,979 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:47:14,979 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:14,981 INFO ]: With dead ends: 24 [2018-06-26 20:47:14,981 INFO ]: Without dead ends: 24 [2018-06-26 20:47:14,981 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:14,981 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 20:47:14,988 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-06-26 20:47:14,988 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 20:47:14,990 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2951 transitions. [2018-06-26 20:47:14,990 INFO ]: Start accepts. Automaton has 23 states and 2951 transitions. Word has length 10 [2018-06-26 20:47:14,990 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:14,990 INFO ]: Abstraction has 23 states and 2951 transitions. [2018-06-26 20:47:14,990 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:14,990 INFO ]: Start isEmpty. Operand 23 states and 2951 transitions. [2018-06-26 20:47:14,992 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:47:14,992 INFO ]: Found error trace [2018-06-26 20:47:14,992 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:14,992 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:14,992 INFO ]: Analyzing trace with hash -552779059, now seen corresponding path program 1 times [2018-06-26 20:47:14,992 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:14,992 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:14,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:14,993 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:14,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:15,019 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:15,071 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:47:15,071 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:15,071 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:15,071 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:15,071 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:15,071 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:15,071 INFO ]: Start difference. First operand 23 states and 2951 transitions. Second operand 3 states. [2018-06-26 20:47:17,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:17,201 INFO ]: Finished difference Result 26 states and 3529 transitions. [2018-06-26 20:47:17,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:17,201 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:47:17,201 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:17,204 INFO ]: With dead ends: 26 [2018-06-26 20:47:17,204 INFO ]: Without dead ends: 26 [2018-06-26 20:47:17,204 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:17,204 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 20:47:17,212 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-06-26 20:47:17,212 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 20:47:17,214 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2951 transitions. [2018-06-26 20:47:17,214 INFO ]: Start accepts. Automaton has 23 states and 2951 transitions. Word has length 10 [2018-06-26 20:47:17,214 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:17,214 INFO ]: Abstraction has 23 states and 2951 transitions. [2018-06-26 20:47:17,214 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:17,214 INFO ]: Start isEmpty. Operand 23 states and 2951 transitions. [2018-06-26 20:47:17,215 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:47:17,215 INFO ]: Found error trace [2018-06-26 20:47:17,215 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:17,215 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:17,215 INFO ]: Analyzing trace with hash -258175860, now seen corresponding path program 1 times [2018-06-26 20:47:17,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:17,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:17,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:17,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:17,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:17,241 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:17,332 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:47:17,332 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:17,332 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:17,332 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:17,332 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:17,332 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:17,332 INFO ]: Start difference. First operand 23 states and 2951 transitions. Second operand 3 states. [2018-06-26 20:47:19,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:19,687 INFO ]: Finished difference Result 39 states and 4638 transitions. [2018-06-26 20:47:19,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:19,691 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:47:19,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:19,696 INFO ]: With dead ends: 39 [2018-06-26 20:47:19,696 INFO ]: Without dead ends: 39 [2018-06-26 20:47:19,696 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:19,696 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 20:47:19,708 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 20:47:19,708 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 20:47:19,712 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 4638 transitions. [2018-06-26 20:47:19,712 INFO ]: Start accepts. Automaton has 39 states and 4638 transitions. Word has length 10 [2018-06-26 20:47:19,713 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:19,713 INFO ]: Abstraction has 39 states and 4638 transitions. [2018-06-26 20:47:19,713 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:19,713 INFO ]: Start isEmpty. Operand 39 states and 4638 transitions. [2018-06-26 20:47:19,716 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:47:19,716 INFO ]: Found error trace [2018-06-26 20:47:19,716 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:19,716 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:19,716 INFO ]: Analyzing trace with hash -183370659, now seen corresponding path program 1 times [2018-06-26 20:47:19,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:19,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:19,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:19,717 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:19,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:19,741 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:19,819 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:47:19,819 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:19,819 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:19,820 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:19,820 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:19,820 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:19,820 INFO ]: Start difference. First operand 39 states and 4638 transitions. Second operand 3 states. [2018-06-26 20:47:22,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:22,118 INFO ]: Finished difference Result 45 states and 4726 transitions. [2018-06-26 20:47:22,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:22,118 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:47:22,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:22,121 INFO ]: With dead ends: 45 [2018-06-26 20:47:22,121 INFO ]: Without dead ends: 43 [2018-06-26 20:47:22,121 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:22,121 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 20:47:22,129 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-26 20:47:22,130 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 20:47:22,133 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 4722 transitions. [2018-06-26 20:47:22,133 INFO ]: Start accepts. Automaton has 43 states and 4722 transitions. Word has length 10 [2018-06-26 20:47:22,133 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:22,133 INFO ]: Abstraction has 43 states and 4722 transitions. [2018-06-26 20:47:22,133 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:22,133 INFO ]: Start isEmpty. Operand 43 states and 4722 transitions. [2018-06-26 20:47:22,136 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:47:22,136 INFO ]: Found error trace [2018-06-26 20:47:22,136 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:22,136 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:22,136 INFO ]: Analyzing trace with hash -1007055971, now seen corresponding path program 1 times [2018-06-26 20:47:22,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:22,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:22,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:22,137 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:22,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:22,162 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:22,257 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:47:22,257 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:22,257 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:22,258 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:22,258 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:22,258 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:22,258 INFO ]: Start difference. First operand 43 states and 4722 transitions. Second operand 3 states. [2018-06-26 20:47:24,426 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:24,426 INFO ]: Finished difference Result 61 states and 6303 transitions. [2018-06-26 20:47:24,427 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:24,427 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:47:24,427 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:24,433 INFO ]: With dead ends: 61 [2018-06-26 20:47:24,433 INFO ]: Without dead ends: 61 [2018-06-26 20:47:24,433 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:24,433 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-26 20:47:24,450 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-06-26 20:47:24,450 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-26 20:47:24,456 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 6303 transitions. [2018-06-26 20:47:24,456 INFO ]: Start accepts. Automaton has 61 states and 6303 transitions. Word has length 11 [2018-06-26 20:47:24,456 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:24,456 INFO ]: Abstraction has 61 states and 6303 transitions. [2018-06-26 20:47:24,456 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:24,456 INFO ]: Start isEmpty. Operand 61 states and 6303 transitions. [2018-06-26 20:47:24,459 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:47:24,459 INFO ]: Found error trace [2018-06-26 20:47:24,459 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:24,459 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:24,459 INFO ]: Analyzing trace with hash -1466045908, now seen corresponding path program 1 times [2018-06-26 20:47:24,459 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:24,459 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:24,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:24,460 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:24,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:24,486 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:24,569 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:47:24,570 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:24,570 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:24,570 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:24,570 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:24,570 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:24,570 INFO ]: Start difference. First operand 61 states and 6303 transitions. Second operand 3 states. [2018-06-26 20:47:26,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:26,693 INFO ]: Finished difference Result 97 states and 8451 transitions. [2018-06-26 20:47:26,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:26,693 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:47:26,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:26,699 INFO ]: With dead ends: 97 [2018-06-26 20:47:26,699 INFO ]: Without dead ends: 97 [2018-06-26 20:47:26,699 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:26,699 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-26 20:47:26,719 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-06-26 20:47:26,719 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-26 20:47:26,725 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 8451 transitions. [2018-06-26 20:47:26,725 INFO ]: Start accepts. Automaton has 97 states and 8451 transitions. Word has length 11 [2018-06-26 20:47:26,725 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:26,725 INFO ]: Abstraction has 97 states and 8451 transitions. [2018-06-26 20:47:26,726 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:26,726 INFO ]: Start isEmpty. Operand 97 states and 8451 transitions. [2018-06-26 20:47:26,729 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:47:26,729 INFO ]: Found error trace [2018-06-26 20:47:26,729 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:26,729 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:26,729 INFO ]: Analyzing trace with hash -1458657740, now seen corresponding path program 1 times [2018-06-26 20:47:26,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:26,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:26,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:26,730 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:26,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:26,779 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:26,863 INFO ]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 20:47:26,863 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:26,863 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:26,863 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:26,863 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:26,863 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:26,863 INFO ]: Start difference. First operand 97 states and 8451 transitions. Second operand 3 states. [2018-06-26 20:47:29,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:29,325 INFO ]: Finished difference Result 182 states and 14844 transitions. [2018-06-26 20:47:29,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:29,325 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:47:29,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:29,345 INFO ]: With dead ends: 182 [2018-06-26 20:47:29,345 INFO ]: Without dead ends: 182 [2018-06-26 20:47:29,346 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:29,346 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-26 20:47:29,380 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 102. [2018-06-26 20:47:29,380 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-26 20:47:29,388 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 9931 transitions. [2018-06-26 20:47:29,388 INFO ]: Start accepts. Automaton has 102 states and 9931 transitions. Word has length 11 [2018-06-26 20:47:29,388 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:29,388 INFO ]: Abstraction has 102 states and 9931 transitions. [2018-06-26 20:47:29,388 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:29,388 INFO ]: Start isEmpty. Operand 102 states and 9931 transitions. [2018-06-26 20:47:29,391 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:47:29,391 INFO ]: Found error trace [2018-06-26 20:47:29,391 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:29,391 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:29,391 INFO ]: Analyzing trace with hash -966421047, now seen corresponding path program 1 times [2018-06-26 20:47:29,391 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:29,391 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:29,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:29,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:29,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:29,412 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:29,496 INFO ]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 20:47:29,496 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:29,496 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:29,496 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:29,496 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:29,496 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:29,496 INFO ]: Start difference. First operand 102 states and 9931 transitions. Second operand 3 states. [2018-06-26 20:47:32,209 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:32,209 INFO ]: Finished difference Result 192 states and 17579 transitions. [2018-06-26 20:47:32,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:32,209 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:47:32,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:32,221 INFO ]: With dead ends: 192 [2018-06-26 20:47:32,221 INFO ]: Without dead ends: 192 [2018-06-26 20:47:32,221 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:32,221 INFO ]: Start minimizeSevpa. Operand 192 states. [2018-06-26 20:47:32,255 INFO ]: Finished minimizeSevpa. Reduced states from 192 to 182. [2018-06-26 20:47:32,255 INFO ]: Start removeUnreachable. Operand 182 states. [2018-06-26 20:47:32,267 INFO ]: Finished removeUnreachable. Reduced from 182 states to 182 states and 17564 transitions. [2018-06-26 20:47:32,267 INFO ]: Start accepts. Automaton has 182 states and 17564 transitions. Word has length 11 [2018-06-26 20:47:32,267 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:32,267 INFO ]: Abstraction has 182 states and 17564 transitions. [2018-06-26 20:47:32,267 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:32,267 INFO ]: Start isEmpty. Operand 182 states and 17564 transitions. [2018-06-26 20:47:32,273 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:47:32,273 INFO ]: Found error trace [2018-06-26 20:47:32,273 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:32,273 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:32,273 INFO ]: Analyzing trace with hash -573976778, now seen corresponding path program 1 times [2018-06-26 20:47:32,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:32,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:32,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:32,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:32,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:32,296 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:32,373 INFO ]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:47:32,373 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:32,373 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:32,374 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:32,374 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:32,374 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:32,374 INFO ]: Start difference. First operand 182 states and 17564 transitions. Second operand 3 states. [2018-06-26 20:47:34,668 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:34,668 INFO ]: Finished difference Result 272 states and 24395 transitions. [2018-06-26 20:47:34,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:34,669 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:47:34,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:34,678 INFO ]: With dead ends: 272 [2018-06-26 20:47:34,678 INFO ]: Without dead ends: 272 [2018-06-26 20:47:34,678 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:34,678 INFO ]: Start minimizeSevpa. Operand 272 states. [2018-06-26 20:47:34,721 INFO ]: Finished minimizeSevpa. Reduced states from 272 to 262. [2018-06-26 20:47:34,721 INFO ]: Start removeUnreachable. Operand 262 states. [2018-06-26 20:47:34,736 INFO ]: Finished removeUnreachable. Reduced from 262 states to 262 states and 24380 transitions. [2018-06-26 20:47:34,736 INFO ]: Start accepts. Automaton has 262 states and 24380 transitions. Word has length 11 [2018-06-26 20:47:34,737 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:34,737 INFO ]: Abstraction has 262 states and 24380 transitions. [2018-06-26 20:47:34,737 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:34,737 INFO ]: Start isEmpty. Operand 262 states and 24380 transitions. [2018-06-26 20:47:34,743 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:47:34,743 INFO ]: Found error trace [2018-06-26 20:47:34,743 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:34,743 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:34,743 INFO ]: Analyzing trace with hash 1787421113, now seen corresponding path program 1 times [2018-06-26 20:47:34,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:34,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:34,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:34,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:34,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:34,767 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:34,858 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:47:34,858 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:34,859 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:34,859 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:34,859 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:34,859 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:34,859 INFO ]: Start difference. First operand 262 states and 24380 transitions. Second operand 3 states. [2018-06-26 20:47:37,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:37,263 INFO ]: Finished difference Result 313 states and 27068 transitions. [2018-06-26 20:47:37,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:37,263 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:47:37,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:37,275 INFO ]: With dead ends: 313 [2018-06-26 20:47:37,275 INFO ]: Without dead ends: 313 [2018-06-26 20:47:37,276 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:37,276 INFO ]: Start minimizeSevpa. Operand 313 states. [2018-06-26 20:47:37,323 INFO ]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-06-26 20:47:37,323 INFO ]: Start removeUnreachable. Operand 313 states. [2018-06-26 20:47:37,341 INFO ]: Finished removeUnreachable. Reduced from 313 states to 313 states and 27068 transitions. [2018-06-26 20:47:37,341 INFO ]: Start accepts. Automaton has 313 states and 27068 transitions. Word has length 13 [2018-06-26 20:47:37,341 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:37,341 INFO ]: Abstraction has 313 states and 27068 transitions. [2018-06-26 20:47:37,341 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:37,341 INFO ]: Start isEmpty. Operand 313 states and 27068 transitions. [2018-06-26 20:47:37,349 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:47:37,349 INFO ]: Found error trace [2018-06-26 20:47:37,349 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:37,349 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:37,350 INFO ]: Analyzing trace with hash -2134948633, now seen corresponding path program 1 times [2018-06-26 20:47:37,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:37,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:37,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:37,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:37,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:37,379 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:37,465 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 20:47:37,465 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:37,466 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:37,466 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:37,466 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:37,466 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:37,466 INFO ]: Start difference. First operand 313 states and 27068 transitions. Second operand 3 states. [2018-06-26 20:47:39,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:39,697 INFO ]: Finished difference Result 533 states and 23597 transitions. [2018-06-26 20:47:39,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:39,698 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:47:39,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:39,711 INFO ]: With dead ends: 533 [2018-06-26 20:47:39,711 INFO ]: Without dead ends: 533 [2018-06-26 20:47:39,711 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:39,712 INFO ]: Start minimizeSevpa. Operand 533 states. [2018-06-26 20:47:39,761 INFO ]: Finished minimizeSevpa. Reduced states from 533 to 283. [2018-06-26 20:47:39,761 INFO ]: Start removeUnreachable. Operand 283 states. [2018-06-26 20:47:39,772 INFO ]: Finished removeUnreachable. Reduced from 283 states to 283 states and 23160 transitions. [2018-06-26 20:47:39,772 INFO ]: Start accepts. Automaton has 283 states and 23160 transitions. Word has length 13 [2018-06-26 20:47:39,772 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:39,772 INFO ]: Abstraction has 283 states and 23160 transitions. [2018-06-26 20:47:39,772 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:39,772 INFO ]: Start isEmpty. Operand 283 states and 23160 transitions. [2018-06-26 20:47:39,779 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:47:39,779 INFO ]: Found error trace [2018-06-26 20:47:39,779 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:39,779 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:39,779 INFO ]: Analyzing trace with hash -507453949, now seen corresponding path program 1 times [2018-06-26 20:47:39,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:39,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:39,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:39,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:39,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:39,814 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:39,890 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:47:39,890 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:39,890 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:39,890 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:39,890 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:39,890 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:39,890 INFO ]: Start difference. First operand 283 states and 23160 transitions. Second operand 3 states. [2018-06-26 20:47:42,460 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:42,460 INFO ]: Finished difference Result 288 states and 20850 transitions. [2018-06-26 20:47:42,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:42,509 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:47:42,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:42,516 INFO ]: With dead ends: 288 [2018-06-26 20:47:42,516 INFO ]: Without dead ends: 288 [2018-06-26 20:47:42,516 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:42,516 INFO ]: Start minimizeSevpa. Operand 288 states. [2018-06-26 20:47:42,552 INFO ]: Finished minimizeSevpa. Reduced states from 288 to 283. [2018-06-26 20:47:42,552 INFO ]: Start removeUnreachable. Operand 283 states. [2018-06-26 20:47:42,563 INFO ]: Finished removeUnreachable. Reduced from 283 states to 283 states and 20842 transitions. [2018-06-26 20:47:42,563 INFO ]: Start accepts. Automaton has 283 states and 20842 transitions. Word has length 13 [2018-06-26 20:47:42,563 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:42,563 INFO ]: Abstraction has 283 states and 20842 transitions. [2018-06-26 20:47:42,563 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:42,563 INFO ]: Start isEmpty. Operand 283 states and 20842 transitions. [2018-06-26 20:47:42,566 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:47:42,566 INFO ]: Found error trace [2018-06-26 20:47:42,566 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:42,566 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:42,566 INFO ]: Analyzing trace with hash -1659456615, now seen corresponding path program 1 times [2018-06-26 20:47:42,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:42,566 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:42,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:42,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:42,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:42,590 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:42,722 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:47:42,722 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:42,722 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:42,722 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:42,722 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:42,722 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:42,722 INFO ]: Start difference. First operand 283 states and 20842 transitions. Second operand 3 states. [2018-06-26 20:47:44,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:44,975 INFO ]: Finished difference Result 305 states and 21373 transitions. [2018-06-26 20:47:44,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:44,975 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:47:44,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:44,981 INFO ]: With dead ends: 305 [2018-06-26 20:47:44,981 INFO ]: Without dead ends: 305 [2018-06-26 20:47:44,982 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:44,982 INFO ]: Start minimizeSevpa. Operand 305 states. [2018-06-26 20:47:45,013 INFO ]: Finished minimizeSevpa. Reduced states from 305 to 219. [2018-06-26 20:47:45,013 INFO ]: Start removeUnreachable. Operand 219 states. [2018-06-26 20:47:45,024 INFO ]: Finished removeUnreachable. Reduced from 219 states to 219 states and 16383 transitions. [2018-06-26 20:47:45,024 INFO ]: Start accepts. Automaton has 219 states and 16383 transitions. Word has length 13 [2018-06-26 20:47:45,024 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:45,024 INFO ]: Abstraction has 219 states and 16383 transitions. [2018-06-26 20:47:45,024 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:45,024 INFO ]: Start isEmpty. Operand 219 states and 16383 transitions. [2018-06-26 20:47:45,028 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:47:45,028 INFO ]: Found error trace [2018-06-26 20:47:45,028 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:47:45,028 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:45,028 INFO ]: Analyzing trace with hash -1085684303, now seen corresponding path program 1 times [2018-06-26 20:47:45,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:45,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:45,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:45,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:45,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:45,057 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:45,143 INFO ]: Checked inductivity of 36 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 20:47:45,144 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:45,144 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:45,144 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:45,144 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:45,144 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:45,144 INFO ]: Start difference. First operand 219 states and 16383 transitions. Second operand 3 states. Received shutdown request... [2018-06-26 20:47:45,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:45,536 WARN ]: Verification canceled [2018-06-26 20:47:45,539 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:47:45,540 WARN ]: Timeout [2018-06-26 20:47:45,540 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:47:45 BasicIcfg [2018-06-26 20:47:45,540 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:47:45,540 INFO ]: Toolchain (without parser) took 67534.84 ms. Allocated memory was 307.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 241.7 MB in the beginning and 1.1 GB in the end (delta: -893.1 MB). Peak memory consumption was 162.3 MB. Max. memory is 3.6 GB. [2018-06-26 20:47:45,541 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 307.2 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:47:45,542 INFO ]: ChcToBoogie took 85.82 ms. Allocated memory is still 307.2 MB. Free memory was 240.7 MB in the beginning and 237.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:47:45,542 INFO ]: Boogie Preprocessor took 52.25 ms. Allocated memory is still 307.2 MB. Free memory was 237.8 MB in the beginning and 235.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:47:45,542 INFO ]: RCFGBuilder took 433.89 ms. Allocated memory is still 307.2 MB. Free memory was 235.8 MB in the beginning and 204.8 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:47:45,543 INFO ]: BlockEncodingV2 took 1891.97 ms. Allocated memory was 307.2 MB in the beginning and 406.3 MB in the end (delta: 99.1 MB). Free memory was 203.8 MB in the beginning and 290.0 MB in the end (delta: -86.2 MB). Peak memory consumption was 129.9 MB. Max. memory is 3.6 GB. [2018-06-26 20:47:45,544 INFO ]: TraceAbstraction took 65058.10 ms. Allocated memory was 406.3 MB in the beginning and 1.4 GB in the end (delta: 956.3 MB). Free memory was 290.0 MB in the beginning and 1.1 GB in the end (delta: -844.8 MB). Peak memory consumption was 111.5 MB. Max. memory is 3.6 GB. [2018-06-26 20:47:45,547 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 884 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 307.2 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 85.82 ms. Allocated memory is still 307.2 MB. Free memory was 240.7 MB in the beginning and 237.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.25 ms. Allocated memory is still 307.2 MB. Free memory was 237.8 MB in the beginning and 235.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 433.89 ms. Allocated memory is still 307.2 MB. Free memory was 235.8 MB in the beginning and 204.8 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1891.97 ms. Allocated memory was 307.2 MB in the beginning and 406.3 MB in the end (delta: 99.1 MB). Free memory was 203.8 MB in the beginning and 290.0 MB in the end (delta: -86.2 MB). Peak memory consumption was 129.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 65058.10 ms. Allocated memory was 406.3 MB in the beginning and 1.4 GB in the end (delta: 956.3 MB). Free memory was 290.0 MB in the beginning and 1.1 GB in the end (delta: -844.8 MB). Peak memory consumption was 111.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (219states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (6 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 65.0s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 61.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 0 SDslu, 94 SDs, 0 SdLazy, 20519 SolverSat, 14729 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=21, 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.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 456 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 2690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 429/429 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/s3_srvr_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-47-45-565.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-47-45-565.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-47-45-565.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-47-45-565.csv Completed graceful shutdown