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/lustre/speed2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 06:58:20,380 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 06:58:20,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 06:58:20,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 06:58:20,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 06:58:20,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 06:58:20,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 06:58:20,405 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 06:58:20,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 06:58:20,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 06:58:20,412 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 06:58:20,412 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 06:58:20,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 06:58:20,427 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 06:58:20,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 06:58:20,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 06:58:20,431 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 06:58:20,432 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 06:58:20,438 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 06:58:20,439 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 06:58:20,440 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 06:58:20,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 06:58:20,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 06:58:20,446 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 06:58:20,447 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 06:58:20,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 06:58:20,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 06:58:20,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 06:58:20,455 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 06:58:20,455 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 06:58:20,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 06:58:20,462 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 06:58:20,463 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 06:58:20,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 06:58:20,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 06:58:20,464 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 06:58:20,489 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 06:58:20,490 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 06:58:20,491 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 06:58:20,492 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 06:58:20,493 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 06:58:20,493 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 06:58:20,493 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 06:58:20,493 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 06:58:20,493 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 06:58:20,494 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 06:58:20,494 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 06:58:20,494 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 06:58:20,494 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:58:20,494 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 06:58:20,495 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 06:58:20,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 06:58:20,498 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 06:58:20,498 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 06:58:20,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 06:58:20,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 06:58:20,499 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 06:58:20,501 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 06:58:20,501 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 06:58:20,545 INFO ]: Repository-Root is: /tmp [2018-06-25 06:58:20,569 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 06:58:20,577 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 06:58:20,579 INFO ]: Initializing SmtParser... [2018-06-25 06:58:20,579 INFO ]: SmtParser initialized [2018-06-25 06:58:20,580 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2.smt2 [2018-06-25 06:58:20,582 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-25 06:58:20,688 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2.smt2 unknown [2018-06-25 06:58:20,982 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2.smt2 [2018-06-25 06:58:20,987 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 06:58:20,996 INFO ]: Walking toolchain with 5 elements. [2018-06-25 06:58:20,996 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 06:58:20,996 INFO ]: Initializing ChcToBoogie... [2018-06-25 06:58:20,997 INFO ]: ChcToBoogie initialized [2018-06-25 06:58:21,000 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:58:20" (1/1) ... [2018-06-25 06:58:21,064 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:21 Unit [2018-06-25 06:58:21,065 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 06:58:21,065 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 06:58:21,065 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 06:58:21,065 INFO ]: Boogie Preprocessor initialized [2018-06-25 06:58:21,088 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:21" (1/1) ... [2018-06-25 06:58:21,089 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:21" (1/1) ... [2018-06-25 06:58:21,099 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:21" (1/1) ... [2018-06-25 06:58:21,099 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:21" (1/1) ... [2018-06-25 06:58:21,114 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:21" (1/1) ... [2018-06-25 06:58:21,116 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:21" (1/1) ... [2018-06-25 06:58:21,118 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:21" (1/1) ... [2018-06-25 06:58:21,125 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 06:58:21,125 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 06:58:21,125 INFO ]: Initializing RCFGBuilder... [2018-06-25 06:58:21,125 INFO ]: RCFGBuilder initialized [2018-06-25 06:58:21,126 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:21" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 06:58:21,152 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 06:58:21,152 INFO ]: Found specification of procedure gotoProc [2018-06-25 06:58:21,152 INFO ]: Found implementation of procedure gotoProc [2018-06-25 06:58:21,152 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 06:58:21,152 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 06:58:21,152 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:58:21,465 INFO ]: Using library mode [2018-06-25 06:58:21,466 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:58:21 BoogieIcfgContainer [2018-06-25 06:58:21,466 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 06:58:21,467 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 06:58:21,467 INFO ]: Initializing BlockEncodingV2... [2018-06-25 06:58:21,468 INFO ]: BlockEncodingV2 initialized [2018-06-25 06:58:21,469 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:58:21" (1/1) ... [2018-06-25 06:58:21,509 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 06:58:21,511 INFO ]: Using Remove infeasible edges [2018-06-25 06:58:21,512 INFO ]: Using Maximize final states [2018-06-25 06:58:21,512 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 06:58:21,512 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 06:58:21,514 INFO ]: Using Remove sink states [2018-06-25 06:58:21,515 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 06:58:21,515 INFO ]: Using Use SBE [2018-06-25 06:58:21,522 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:58:23,771 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:58:24,410 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:58:24,663 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:58:24,664 INFO ]: SBE split 2 edges [2018-06-25 06:58:24,685 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 06:58:24,689 INFO ]: 0 new accepting states [2018-06-25 06:58:38,223 INFO ]: Removed 2067 edges and 2 locations by large block encoding [2018-06-25 06:58:38,225 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:58:38,310 INFO ]: Removed 12 edges and 0 locations because of local infeasibility [2018-06-25 06:58:38,311 INFO ]: 0 new accepting states [2018-06-25 06:58:38,313 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:58:38,314 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:58:38,320 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 06:58:38,321 INFO ]: 0 new accepting states [2018-06-25 06:58:38,324 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:58:38,324 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:58:38,338 INFO ]: Encoded RCFG 6 locations, 2057 edges [2018-06-25 06:58:38,338 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:58:38 BasicIcfg [2018-06-25 06:58:38,338 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 06:58:38,340 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 06:58:38,340 INFO ]: Initializing TraceAbstraction... [2018-06-25 06:58:38,343 INFO ]: TraceAbstraction initialized [2018-06-25 06:58:38,343 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:58:20" (1/4) ... [2018-06-25 06:58:38,344 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243e9cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 06:58:38, skipping insertion in model container [2018-06-25 06:58:38,344 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:21" (2/4) ... [2018-06-25 06:58:38,344 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243e9cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 06:58:38, skipping insertion in model container [2018-06-25 06:58:38,344 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:58:21" (3/4) ... [2018-06-25 06:58:38,344 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243e9cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:58:38, skipping insertion in model container [2018-06-25 06:58:38,344 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:58:38" (4/4) ... [2018-06-25 06:58:38,346 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 06:58:38,358 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 06:58:38,367 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 06:58:38,414 INFO ]: Using default assertion order modulation [2018-06-25 06:58:38,414 INFO ]: Interprodecural is true [2018-06-25 06:58:38,414 INFO ]: Hoare is false [2018-06-25 06:58:38,414 INFO ]: Compute interpolants for FPandBP [2018-06-25 06:58:38,414 INFO ]: Backedges is TWOTRACK [2018-06-25 06:58:38,414 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 06:58:38,414 INFO ]: Difference is false [2018-06-25 06:58:38,414 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 06:58:38,414 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 06:58:38,434 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 06:58:38,456 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:38,457 INFO ]: Found error trace [2018-06-25 06:58:38,458 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:38,458 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:38,464 INFO ]: Analyzing trace with hash 161085025, now seen corresponding path program 1 times [2018-06-25 06:58:38,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:38,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:38,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:38,521 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:38,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:38,588 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:38,688 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:38,690 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:38,690 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:38,691 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:38,701 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:38,701 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:38,703 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 06:58:42,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:42,030 INFO ]: Finished difference Result 7 states and 2058 transitions. [2018-06-25 06:58:42,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:42,031 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:42,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:42,046 INFO ]: With dead ends: 7 [2018-06-25 06:58:42,046 INFO ]: Without dead ends: 7 [2018-06-25 06:58:42,049 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-25 06:58:42,072 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:42,121 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:42,122 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:42,126 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:42,128 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:42,129 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:42,129 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:42,129 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:42,129 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:42,130 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:42,130 INFO ]: Found error trace [2018-06-25 06:58:42,130 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:42,130 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:42,130 INFO ]: Analyzing trace with hash 161174398, now seen corresponding path program 1 times [2018-06-25 06:58:42,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:42,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:42,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:42,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:42,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:42,145 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:42,184 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:42,184 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:42,184 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:42,186 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:42,186 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:42,186 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:42,186 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:45,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:45,224 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:58:45,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:45,225 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:45,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:45,228 INFO ]: With dead ends: 9 [2018-06-25 06:58:45,228 INFO ]: Without dead ends: 9 [2018-06-25 06:58:45,228 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-25 06:58:45,228 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:45,241 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:58:45,241 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:45,247 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:45,247 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:45,247 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:45,247 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:45,247 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:45,247 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:45,248 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:45,248 INFO ]: Found error trace [2018-06-25 06:58:45,248 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:45,248 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:45,248 INFO ]: Analyzing trace with hash 161204189, now seen corresponding path program 1 times [2018-06-25 06:58:45,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:45,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:45,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:45,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:45,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:45,264 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:45,283 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:45,283 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:45,283 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:45,283 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:45,283 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:45,283 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:45,283 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:48,142 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:48,143 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:58:48,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:48,143 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:48,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:48,146 INFO ]: With dead ends: 9 [2018-06-25 06:58:48,146 INFO ]: Without dead ends: 9 [2018-06-25 06:58:48,146 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-25 06:58:48,146 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:48,159 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:58:48,159 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:48,163 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:48,163 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:48,163 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:48,163 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:48,163 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:48,163 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:48,165 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:48,166 INFO ]: Found error trace [2018-06-25 06:58:48,166 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:48,166 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:48,166 INFO ]: Analyzing trace with hash 161263771, now seen corresponding path program 1 times [2018-06-25 06:58:48,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:48,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:48,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:48,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:48,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:48,187 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:48,263 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:48,264 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:48,264 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:48,264 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:48,264 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:48,264 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:48,264 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:50,267 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:50,267 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:58:50,268 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:50,268 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:50,268 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:50,270 INFO ]: With dead ends: 9 [2018-06-25 06:58:50,270 INFO ]: Without dead ends: 9 [2018-06-25 06:58:50,271 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-25 06:58:50,271 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:50,281 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:58:50,281 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:50,285 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:50,285 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:50,285 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:50,285 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:50,285 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:50,285 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:50,286 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:50,286 INFO ]: Found error trace [2018-06-25 06:58:50,286 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:50,286 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:50,286 INFO ]: Analyzing trace with hash 161680845, now seen corresponding path program 1 times [2018-06-25 06:58:50,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:50,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:50,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:50,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:50,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:50,303 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:50,387 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:50,387 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:50,387 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:50,388 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:50,388 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:50,388 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:50,388 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:52,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:52,658 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:58:52,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:52,660 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:52,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:52,663 INFO ]: With dead ends: 9 [2018-06-25 06:58:52,663 INFO ]: Without dead ends: 9 [2018-06-25 06:58:52,663 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-25 06:58:52,663 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:52,671 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:58:52,672 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:52,675 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:52,676 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:52,676 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:52,676 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:52,676 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:52,676 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:52,678 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:52,678 INFO ]: Found error trace [2018-06-25 06:58:52,678 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:52,678 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:52,678 INFO ]: Analyzing trace with hash 101920099, now seen corresponding path program 1 times [2018-06-25 06:58:52,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:52,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:52,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:52,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:52,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:52,687 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:52,740 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:52,740 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:52,740 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:52,740 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:52,740 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:52,740 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:52,740 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:54,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:54,658 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:58:54,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:54,658 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:54,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:54,660 INFO ]: With dead ends: 9 [2018-06-25 06:58:54,660 INFO ]: Without dead ends: 9 [2018-06-25 06:58:54,660 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-25 06:58:54,660 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:54,666 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:58:54,666 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:54,670 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:54,670 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:54,670 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:54,670 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:54,670 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:54,670 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:54,671 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:54,671 INFO ]: Found error trace [2018-06-25 06:58:54,671 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:54,672 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:54,672 INFO ]: Analyzing trace with hash 102098845, now seen corresponding path program 1 times [2018-06-25 06:58:54,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:54,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:54,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:54,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:54,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:54,681 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:54,723 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:54,723 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:54,723 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:54,723 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:54,723 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:54,723 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:54,724 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:56,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:56,525 INFO ]: Finished difference Result 8 states and 2059 transitions. [2018-06-25 06:58:56,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:56,529 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:56,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:56,532 INFO ]: With dead ends: 8 [2018-06-25 06:58:56,532 INFO ]: Without dead ends: 8 [2018-06-25 06:58:56,532 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-25 06:58:56,532 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:58:56,536 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:58:56,536 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:56,539 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:56,539 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:56,539 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:56,539 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:56,539 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:56,539 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:56,540 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:56,540 INFO ]: Found error trace [2018-06-25 06:58:56,540 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:56,540 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:56,540 INFO ]: Analyzing trace with hash 579709331, now seen corresponding path program 1 times [2018-06-25 06:58:56,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:56,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:56,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:56,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:56,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:56,575 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:56,646 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:56,646 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:56,646 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:56,646 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:56,646 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:56,646 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:56,646 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:58,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:58,618 INFO ]: Finished difference Result 8 states and 2058 transitions. [2018-06-25 06:58:58,618 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:58,618 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:58,618 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:58,620 INFO ]: With dead ends: 8 [2018-06-25 06:58:58,620 INFO ]: Without dead ends: 7 [2018-06-25 06:58:58,620 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-25 06:58:58,620 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:58,624 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:58,624 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:58,624 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1034 transitions. [2018-06-25 06:58:58,624 INFO ]: Start accepts. Automaton has 7 states and 1034 transitions. Word has length 6 [2018-06-25 06:58:58,624 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:58,624 INFO ]: Abstraction has 7 states and 1034 transitions. [2018-06-25 06:58:58,625 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:58,625 INFO ]: Start isEmpty. Operand 7 states and 1034 transitions. [2018-06-25 06:58:58,625 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:58,625 INFO ]: Found error trace [2018-06-25 06:58:58,625 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:58,625 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:58,625 INFO ]: Analyzing trace with hash 583403415, now seen corresponding path program 1 times [2018-06-25 06:58:58,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:58,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:58,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:58,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:58,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:58,653 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:58,694 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:58,694 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:58,694 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:58,694 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:58,694 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:58,694 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:58,695 INFO ]: Start difference. First operand 7 states and 1034 transitions. Second operand 3 states. [2018-06-25 06:58:59,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:59,666 INFO ]: Finished difference Result 8 states and 1034 transitions. [2018-06-25 06:58:59,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:59,667 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:59,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:59,668 INFO ]: With dead ends: 8 [2018-06-25 06:58:59,668 INFO ]: Without dead ends: 7 [2018-06-25 06:58:59,668 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-25 06:58:59,668 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:59,670 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:59,670 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:59,670 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 522 transitions. [2018-06-25 06:58:59,670 INFO ]: Start accepts. Automaton has 7 states and 522 transitions. Word has length 6 [2018-06-25 06:58:59,670 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:59,670 INFO ]: Abstraction has 7 states and 522 transitions. [2018-06-25 06:58:59,670 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:59,670 INFO ]: Start isEmpty. Operand 7 states and 522 transitions. [2018-06-25 06:58:59,671 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:59,671 INFO ]: Found error trace [2018-06-25 06:58:59,671 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:59,671 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:59,671 INFO ]: Analyzing trace with hash -365052652, now seen corresponding path program 1 times [2018-06-25 06:58:59,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:59,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:59,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:59,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:59,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:59,682 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:59,705 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:59,705 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:59,705 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:59,705 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:59,706 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:59,706 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:59,706 INFO ]: Start difference. First operand 7 states and 522 transitions. Second operand 3 states. [2018-06-25 06:59:00,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:00,204 INFO ]: Finished difference Result 8 states and 522 transitions. [2018-06-25 06:59:00,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:00,225 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:59:00,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:00,226 INFO ]: With dead ends: 8 [2018-06-25 06:59:00,226 INFO ]: Without dead ends: 7 [2018-06-25 06:59:00,226 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-25 06:59:00,226 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:59:00,227 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:59:00,227 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:59:00,227 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2018-06-25 06:59:00,228 INFO ]: Start accepts. Automaton has 7 states and 394 transitions. Word has length 6 [2018-06-25 06:59:00,228 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:00,228 INFO ]: Abstraction has 7 states and 394 transitions. [2018-06-25 06:59:00,228 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:00,228 INFO ]: Start isEmpty. Operand 7 states and 394 transitions. [2018-06-25 06:59:00,228 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:59:00,228 INFO ]: Found error trace [2018-06-25 06:59:00,228 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:59:00,228 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:00,228 INFO ]: Analyzing trace with hash 106866579, now seen corresponding path program 1 times [2018-06-25 06:59:00,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:00,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:00,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:00,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:00,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:00,247 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:00,276 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:00,276 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:00,277 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:00,277 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:00,277 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:00,277 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:00,277 INFO ]: Start difference. First operand 7 states and 394 transitions. Second operand 3 states. [2018-06-25 06:59:00,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:00,635 INFO ]: Finished difference Result 8 states and 394 transitions. [2018-06-25 06:59:00,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:00,635 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:59:00,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:00,636 INFO ]: With dead ends: 8 [2018-06-25 06:59:00,636 INFO ]: Without dead ends: 7 [2018-06-25 06:59:00,636 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-25 06:59:00,636 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:59:00,637 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:59:00,637 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:59:00,637 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 330 transitions. [2018-06-25 06:59:00,637 INFO ]: Start accepts. Automaton has 7 states and 330 transitions. Word has length 6 [2018-06-25 06:59:00,637 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:00,637 INFO ]: Abstraction has 7 states and 330 transitions. [2018-06-25 06:59:00,637 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:00,637 INFO ]: Start isEmpty. Operand 7 states and 330 transitions. [2018-06-25 06:59:00,638 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:59:00,638 INFO ]: Found error trace [2018-06-25 06:59:00,638 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:59:00,638 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:00,638 INFO ]: Analyzing trace with hash -363205610, now seen corresponding path program 1 times [2018-06-25 06:59:00,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:00,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:00,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:00,638 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:00,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:00,658 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:00,776 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:00,776 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:00,776 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:00,776 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:00,777 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:00,777 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:00,777 INFO ]: Start difference. First operand 7 states and 330 transitions. Second operand 3 states. [2018-06-25 06:59:01,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:01,081 INFO ]: Finished difference Result 8 states and 330 transitions. [2018-06-25 06:59:01,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:01,082 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:59:01,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:01,082 INFO ]: With dead ends: 8 [2018-06-25 06:59:01,082 INFO ]: Without dead ends: 7 [2018-06-25 06:59:01,083 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-25 06:59:01,083 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:59:01,083 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:59:01,083 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:59:01,084 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2018-06-25 06:59:01,084 INFO ]: Start accepts. Automaton has 7 states and 202 transitions. Word has length 6 [2018-06-25 06:59:01,084 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:01,084 INFO ]: Abstraction has 7 states and 202 transitions. [2018-06-25 06:59:01,084 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:01,084 INFO ]: Start isEmpty. Operand 7 states and 202 transitions. [2018-06-25 06:59:01,084 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:59:01,084 INFO ]: Found error trace [2018-06-25 06:59:01,084 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:59:01,084 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:01,084 INFO ]: Analyzing trace with hash 343287955, now seen corresponding path program 1 times [2018-06-25 06:59:01,084 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:01,084 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:01,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:01,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:01,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:01,096 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:01,203 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:01,203 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:01,203 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:01,203 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:01,203 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:01,203 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:01,203 INFO ]: Start difference. First operand 7 states and 202 transitions. Second operand 3 states. [2018-06-25 06:59:01,405 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:01,405 INFO ]: Finished difference Result 8 states and 202 transitions. [2018-06-25 06:59:01,406 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:01,406 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:59:01,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:01,406 INFO ]: With dead ends: 8 [2018-06-25 06:59:01,406 INFO ]: Without dead ends: 7 [2018-06-25 06:59:01,406 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-25 06:59:01,407 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:59:01,407 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:59:01,407 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:59:01,407 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2018-06-25 06:59:01,407 INFO ]: Start accepts. Automaton has 7 states and 138 transitions. Word has length 6 [2018-06-25 06:59:01,408 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:01,408 INFO ]: Abstraction has 7 states and 138 transitions. [2018-06-25 06:59:01,408 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:01,408 INFO ]: Start isEmpty. Operand 7 states and 138 transitions. [2018-06-25 06:59:01,408 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:59:01,408 INFO ]: Found error trace [2018-06-25 06:59:01,408 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:59:01,408 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:01,408 INFO ]: Analyzing trace with hash -1074316780, now seen corresponding path program 1 times [2018-06-25 06:59:01,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:01,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:01,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:01,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:01,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:01,419 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:01,551 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:01,551 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:01,551 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:01,551 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:01,551 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:01,551 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:01,551 INFO ]: Start difference. First operand 7 states and 138 transitions. Second operand 3 states. [2018-06-25 06:59:01,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:01,687 INFO ]: Finished difference Result 8 states and 138 transitions. [2018-06-25 06:59:01,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:01,688 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:59:01,688 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:01,688 INFO ]: With dead ends: 8 [2018-06-25 06:59:01,688 INFO ]: Without dead ends: 7 [2018-06-25 06:59:01,688 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:01,688 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:59:01,689 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:59:01,689 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:59:01,689 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-06-25 06:59:01,689 INFO ]: Start accepts. Automaton has 7 states and 74 transitions. Word has length 6 [2018-06-25 06:59:01,690 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:01,690 INFO ]: Abstraction has 7 states and 74 transitions. [2018-06-25 06:59:01,690 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:01,690 INFO ]: Start isEmpty. Operand 7 states and 74 transitions. [2018-06-25 06:59:01,690 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:59:01,690 INFO ]: Found error trace [2018-06-25 06:59:01,690 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:59:01,690 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:01,690 INFO ]: Analyzing trace with hash -720608237, now seen corresponding path program 1 times [2018-06-25 06:59:01,690 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:01,690 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:01,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:01,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:01,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:01,699 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:01,819 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:01,819 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:01,819 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:01,819 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:01,819 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:01,819 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:01,819 INFO ]: Start difference. First operand 7 states and 74 transitions. Second operand 3 states. [2018-06-25 06:59:02,543 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:02,543 INFO ]: Finished difference Result 8 states and 74 transitions. [2018-06-25 06:59:02,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:02,543 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:59:02,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:02,543 INFO ]: With dead ends: 8 [2018-06-25 06:59:02,543 INFO ]: Without dead ends: 7 [2018-06-25 06:59:02,544 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:02,544 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:59:02,545 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:59:02,545 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:59:02,545 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-06-25 06:59:02,545 INFO ]: Start accepts. Automaton has 7 states and 58 transitions. Word has length 6 [2018-06-25 06:59:02,545 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:02,545 INFO ]: Abstraction has 7 states and 58 transitions. [2018-06-25 06:59:02,545 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:02,545 INFO ]: Start isEmpty. Operand 7 states and 58 transitions. [2018-06-25 06:59:02,545 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:59:02,545 INFO ]: Found error trace [2018-06-25 06:59:02,545 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:59:02,545 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:02,545 INFO ]: Analyzing trace with hash -187736620, now seen corresponding path program 1 times [2018-06-25 06:59:02,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:02,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:02,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:02,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:02,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:02,563 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:02,612 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:02,612 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:02,612 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:02,612 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:02,613 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:02,613 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:02,613 INFO ]: Start difference. First operand 7 states and 58 transitions. Second operand 3 states. [2018-06-25 06:59:02,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:02,672 INFO ]: Finished difference Result 8 states and 58 transitions. [2018-06-25 06:59:02,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:02,673 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:59:02,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:02,673 INFO ]: With dead ends: 8 [2018-06-25 06:59:02,673 INFO ]: Without dead ends: 7 [2018-06-25 06:59:02,673 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-25 06:59:02,673 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:59:02,674 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:59:02,674 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:59:02,674 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-06-25 06:59:02,674 INFO ]: Start accepts. Automaton has 7 states and 42 transitions. Word has length 6 [2018-06-25 06:59:02,674 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:02,674 INFO ]: Abstraction has 7 states and 42 transitions. [2018-06-25 06:59:02,674 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:02,674 INFO ]: Start isEmpty. Operand 7 states and 42 transitions. [2018-06-25 06:59:02,675 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:59:02,675 INFO ]: Found error trace [2018-06-25 06:59:02,675 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:59:02,675 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:02,675 INFO ]: Analyzing trace with hash 406087383, now seen corresponding path program 1 times [2018-06-25 06:59:02,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:02,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:02,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:02,675 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:02,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:02,685 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:02,744 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:02,744 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:02,744 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:02,744 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:02,744 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:02,744 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:02,744 INFO ]: Start difference. First operand 7 states and 42 transitions. Second operand 3 states. [2018-06-25 06:59:02,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:02,785 INFO ]: Finished difference Result 8 states and 42 transitions. [2018-06-25 06:59:02,786 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:02,786 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:59:02,786 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:02,786 INFO ]: With dead ends: 8 [2018-06-25 06:59:02,786 INFO ]: Without dead ends: 7 [2018-06-25 06:59:02,786 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-25 06:59:02,787 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:59:02,787 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:59:02,787 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:59:02,788 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2018-06-25 06:59:02,788 INFO ]: Start accepts. Automaton has 7 states and 26 transitions. Word has length 6 [2018-06-25 06:59:02,788 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:02,788 INFO ]: Abstraction has 7 states and 26 transitions. [2018-06-25 06:59:02,788 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:02,788 INFO ]: Start isEmpty. Operand 7 states and 26 transitions. [2018-06-25 06:59:02,788 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:59:02,788 INFO ]: Found error trace [2018-06-25 06:59:02,788 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:59:02,788 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:02,788 INFO ]: Analyzing trace with hash -1045687629, now seen corresponding path program 1 times [2018-06-25 06:59:02,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:02,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:02,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:02,789 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:02,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:02,796 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:02,830 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:02,830 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:59:02,830 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:59:02,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:02,894 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:02,902 INFO ]: Computing forward predicates... [2018-06-25 06:59:02,969 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:03,002 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:59:03,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 06:59:03,003 INFO ]: Interpolant automaton has 4 states [2018-06-25 06:59:03,003 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 06:59:03,003 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 06:59:03,003 INFO ]: Start difference. First operand 7 states and 26 transitions. Second operand 4 states. [2018-06-25 06:59:03,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:03,323 INFO ]: Finished difference Result 9 states and 27 transitions. [2018-06-25 06:59:03,324 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:59:03,324 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 06:59:03,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:03,324 INFO ]: With dead ends: 9 [2018-06-25 06:59:03,324 INFO ]: Without dead ends: 8 [2018-06-25 06:59:03,324 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:59:03,324 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:59:03,325 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:59:03,325 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:59:03,325 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-06-25 06:59:03,325 INFO ]: Start accepts. Automaton has 8 states and 19 transitions. Word has length 6 [2018-06-25 06:59:03,326 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:03,326 INFO ]: Abstraction has 8 states and 19 transitions. [2018-06-25 06:59:03,326 INFO ]: Interpolant automaton has 4 states. [2018-06-25 06:59:03,326 INFO ]: Start isEmpty. Operand 8 states and 19 transitions. [2018-06-25 06:59:03,326 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:59:03,326 INFO ]: Found error trace [2018-06-25 06:59:03,326 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:59:03,326 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:03,326 INFO ]: Analyzing trace with hash -239214735, now seen corresponding path program 1 times [2018-06-25 06:59:03,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:03,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:03,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:03,327 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:03,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:03,347 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:04,141 WARN ]: Spent 726.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-06-25 06:59:04,373 WARN ]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 06:59:04,380 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:04,381 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:59:04,381 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:59:04,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:04,453 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:04,456 INFO ]: Computing forward predicates... [2018-06-25 06:59:04,983 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:05,018 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:59:05,018 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:59:05,018 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:59:05,018 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:59:05,018 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:59:05,018 INFO ]: Start difference. First operand 8 states and 19 transitions. Second operand 8 states. [2018-06-25 06:59:05,547 WARN ]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-25 06:59:05,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:05,671 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-25 06:59:05,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 06:59:05,671 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:59:05,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:05,672 INFO ]: With dead ends: 12 [2018-06-25 06:59:05,672 INFO ]: Without dead ends: 8 [2018-06-25 06:59:05,672 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-25 06:59:05,672 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:59:05,673 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:59:05,673 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:59:05,673 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-25 06:59:05,673 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 7 [2018-06-25 06:59:05,673 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:05,673 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-25 06:59:05,673 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:59:05,673 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-25 06:59:05,673 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:59:05,673 INFO ]: Found error trace [2018-06-25 06:59:05,673 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:59:05,673 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:05,674 INFO ]: Analyzing trace with hash 2023677486, now seen corresponding path program 1 times [2018-06-25 06:59:05,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:05,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:05,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:05,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:05,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:05,696 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:06,304 WARN ]: Spent 535.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-06-25 06:59:06,565 WARN ]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 06:59:06,712 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:06,712 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:59:06,712 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 06:59:06,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:59:06,791 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:06,794 INFO ]: Computing forward predicates... [2018-06-25 06:59:07,010 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-25 06:59:07,551 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:07,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:59:07,586 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:59:07,586 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:59:07,586 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:59:07,586 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:59:07,586 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 8 states. [2018-06-25 06:59:07,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:07,764 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-25 06:59:07,765 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:59:07,765 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:59:07,765 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:07,765 INFO ]: With dead ends: 10 [2018-06-25 06:59:07,765 INFO ]: Without dead ends: 8 [2018-06-25 06:59:07,765 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-25 06:59:07,765 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:59:07,766 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:59:07,766 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:59:07,766 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-06-25 06:59:07,767 INFO ]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 7 [2018-06-25 06:59:07,767 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:07,767 INFO ]: Abstraction has 8 states and 13 transitions. [2018-06-25 06:59:07,767 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:59:07,767 INFO ]: Start isEmpty. Operand 8 states and 13 transitions. [2018-06-25 06:59:07,767 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:59:07,767 INFO ]: Found error trace [2018-06-25 06:59:07,767 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:59:07,767 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:07,767 INFO ]: Analyzing trace with hash -13749403, now seen corresponding path program 1 times [2018-06-25 06:59:07,767 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:07,767 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:07,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:07,768 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:07,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:07,781 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:07,939 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:07,939 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:59:07,939 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:59:07,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:08,003 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:08,006 INFO ]: Computing forward predicates... [2018-06-25 06:59:08,210 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:08,230 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:59:08,230 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 06:59:08,230 INFO ]: Interpolant automaton has 7 states [2018-06-25 06:59:08,231 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 06:59:08,231 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:59:08,231 INFO ]: Start difference. First operand 8 states and 13 transitions. Second operand 7 states. [2018-06-25 06:59:08,265 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:08,265 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-25 06:59:08,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:59:08,265 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 06:59:08,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:08,265 INFO ]: With dead ends: 10 [2018-06-25 06:59:08,265 INFO ]: Without dead ends: 8 [2018-06-25 06:59:08,266 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:59:08,266 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:59:08,266 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:59:08,266 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:59:08,266 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-25 06:59:08,267 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2018-06-25 06:59:08,267 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:08,267 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-25 06:59:08,267 INFO ]: Interpolant automaton has 7 states. [2018-06-25 06:59:08,267 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-25 06:59:08,267 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:59:08,267 INFO ]: Found error trace [2018-06-25 06:59:08,267 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:59:08,267 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:08,267 INFO ]: Analyzing trace with hash -1188733886, now seen corresponding path program 1 times [2018-06-25 06:59:08,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:08,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:08,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:08,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:08,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:08,279 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:09,017 WARN ]: Spent 691.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-06-25 06:59:09,151 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:09,151 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:59:09,151 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:59:09,157 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:09,194 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:09,196 INFO ]: Computing forward predicates... [2018-06-25 06:59:09,257 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:59:09,277 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:59:09,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:59:09,277 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:59:09,277 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:59:09,277 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:59:09,277 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 8 states. [2018-06-25 06:59:09,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:09,342 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-25 06:59:09,343 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 06:59:09,343 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:59:09,343 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:09,343 INFO ]: With dead ends: 4 [2018-06-25 06:59:09,343 INFO ]: Without dead ends: 0 [2018-06-25 06:59:09,343 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-25 06:59:09,343 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 06:59:09,343 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 06:59:09,343 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 06:59:09,343 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 06:59:09,343 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 06:59:09,343 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:09,343 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 06:59:09,343 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:59:09,343 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 06:59:09,343 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 06:59:09,345 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 06:59:09,347 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:59:09 BasicIcfg [2018-06-25 06:59:09,347 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 06:59:09,347 INFO ]: Toolchain (without parser) took 48360.03 ms. Allocated memory was 307.2 MB in the beginning and 1.3 GB in the end (delta: 979.9 MB). Free memory was 259.6 MB in the beginning and 918.8 MB in the end (delta: -659.2 MB). Peak memory consumption was 320.7 MB. Max. memory is 3.6 GB. [2018-06-25 06:59:09,348 INFO ]: SmtParser took 0.12 ms. Allocated memory is still 307.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:59:09,348 INFO ]: ChcToBoogie took 68.49 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 255.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:59:09,349 INFO ]: Boogie Preprocessor took 59.49 ms. Allocated memory is still 307.2 MB. Free memory is still 255.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:59:09,349 INFO ]: RCFGBuilder took 340.90 ms. Allocated memory is still 307.2 MB. Free memory was 255.6 MB in the beginning and 241.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:59:09,349 INFO ]: BlockEncodingV2 took 16871.59 ms. Allocated memory was 307.2 MB in the beginning and 768.1 MB in the end (delta: 460.8 MB). Free memory was 241.7 MB in the beginning and 463.6 MB in the end (delta: -222.0 MB). Peak memory consumption was 434.9 MB. Max. memory is 3.6 GB. [2018-06-25 06:59:09,350 INFO ]: TraceAbstraction took 31006.98 ms. Allocated memory was 768.1 MB in the beginning and 1.3 GB in the end (delta: 519.0 MB). Free memory was 463.6 MB in the beginning and 918.8 MB in the end (delta: -455.2 MB). Peak memory consumption was 63.8 MB. Max. memory is 3.6 GB. [2018-06-25 06:59:09,353 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, 2057 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.12 ms. Allocated memory is still 307.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 68.49 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 255.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 59.49 ms. Allocated memory is still 307.2 MB. Free memory is still 255.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 340.90 ms. Allocated memory is still 307.2 MB. Free memory was 255.6 MB in the beginning and 241.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 16871.59 ms. Allocated memory was 307.2 MB in the beginning and 768.1 MB in the end (delta: 460.8 MB). Free memory was 241.7 MB in the beginning and 463.6 MB in the end (delta: -222.0 MB). Peak memory consumption was 434.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 31006.98 ms. Allocated memory was 768.1 MB in the beginning and 1.3 GB in the end (delta: 519.0 MB). Free memory was 463.6 MB in the beginning and 918.8 MB in the end (delta: -455.2 MB). Peak memory consumption was 63.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 30.9s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 23.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19301 SDtfs, 0 SDslu, 114 SDs, 0 SdLazy, 9163 SolverSat, 10290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 11 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 1973 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1289 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 10/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_06-59-09-364.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_06-59-09-364.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_06-59-09-364.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_06-59-09-364.csv Received shutdown request...