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_e8_449_e7_353.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-27 03:00:14,353 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-27 03:00:14,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-27 03:00:14,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-27 03:00:14,370 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-27 03:00:14,373 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-27 03:00:14,375 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-27 03:00:14,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-27 03:00:14,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-27 03:00:14,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-27 03:00:14,383 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-27 03:00:14,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-27 03:00:14,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-27 03:00:14,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-27 03:00:14,388 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-27 03:00:14,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-27 03:00:14,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-27 03:00:14,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-27 03:00:14,405 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-27 03:00:14,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-27 03:00:14,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-27 03:00:14,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-27 03:00:14,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-27 03:00:14,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-27 03:00:14,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-27 03:00:14,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-27 03:00:14,420 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-27 03:00:14,420 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-27 03:00:14,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-27 03:00:14,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-27 03:00:14,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-27 03:00:14,423 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-27 03:00:14,423 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-27 03:00:14,423 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-27 03:00:14,427 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-27 03:00:14,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-27 03:00:14,427 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-27 03:00:14,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-27 03:00:14,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-27 03:00:14,451 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-27 03:00:14,452 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-27 03:00:14,453 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-27 03:00:14,454 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-27 03:00:14,454 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-27 03:00:14,454 INFO L133 SettingsManager]: * Use SBE=true [2018-06-27 03:00:14,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-27 03:00:14,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-27 03:00:14,455 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-27 03:00:14,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-27 03:00:14,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 03:00:14,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-27 03:00:14,456 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-27 03:00:14,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-27 03:00:14,457 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-27 03:00:14,457 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-27 03:00:14,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-27 03:00:14,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-27 03:00:14,457 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-27 03:00:14,459 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-27 03:00:14,459 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-27 03:00:14,516 INFO ]: Repository-Root is: /tmp [2018-06-27 03:00:14,530 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-27 03:00:14,535 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-27 03:00:14,536 INFO ]: Initializing SmtParser... [2018-06-27 03:00:14,537 INFO ]: SmtParser initialized [2018-06-27 03:00:14,537 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e7_353.smt2 [2018-06-27 03:00:14,538 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-27 03:00:14,624 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e7_353.smt2 unknown [2018-06-27 03:00:14,887 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e7_353.smt2 [2018-06-27 03:00:14,892 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-27 03:00:14,903 INFO ]: Walking toolchain with 5 elements. [2018-06-27 03:00:14,903 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-27 03:00:14,903 INFO ]: Initializing ChcToBoogie... [2018-06-27 03:00:14,904 INFO ]: ChcToBoogie initialized [2018-06-27 03:00:14,907 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 03:00:14" (1/1) ... [2018-06-27 03:00:14,969 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:14 Unit [2018-06-27 03:00:14,969 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-27 03:00:14,970 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-27 03:00:14,970 INFO ]: Initializing Boogie Preprocessor... [2018-06-27 03:00:14,970 INFO ]: Boogie Preprocessor initialized [2018-06-27 03:00:14,991 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:14" (1/1) ... [2018-06-27 03:00:14,991 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:14" (1/1) ... [2018-06-27 03:00:15,000 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:14" (1/1) ... [2018-06-27 03:00:15,001 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:14" (1/1) ... [2018-06-27 03:00:15,005 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:14" (1/1) ... [2018-06-27 03:00:15,006 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:14" (1/1) ... [2018-06-27 03:00:15,008 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:14" (1/1) ... [2018-06-27 03:00:15,010 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-27 03:00:15,010 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-27 03:00:15,010 INFO ]: Initializing RCFGBuilder... [2018-06-27 03:00:15,010 INFO ]: RCFGBuilder initialized [2018-06-27 03:00:15,011 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:14" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 03:00:15,024 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-27 03:00:15,024 INFO ]: Found specification of procedure gotoProc [2018-06-27 03:00:15,024 INFO ]: Found implementation of procedure gotoProc [2018-06-27 03:00:15,024 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-27 03:00:15,024 INFO ]: Found specification of procedure Ultimate.START [2018-06-27 03:00:15,024 INFO ]: Found implementation of procedure Ultimate.START [2018-06-27 03:00:15,320 INFO ]: Using library mode [2018-06-27 03:00:15,321 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 03:00:15 BoogieIcfgContainer [2018-06-27 03:00:15,321 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-27 03:00:15,321 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-27 03:00:15,321 INFO ]: Initializing BlockEncodingV2... [2018-06-27 03:00:15,322 INFO ]: BlockEncodingV2 initialized [2018-06-27 03:00:15,323 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 03:00:15" (1/1) ... [2018-06-27 03:00:15,339 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-27 03:00:15,340 INFO ]: Using Remove infeasible edges [2018-06-27 03:00:15,341 INFO ]: Using Maximize final states [2018-06-27 03:00:15,341 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-27 03:00:15,341 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-27 03:00:15,342 INFO ]: Using Remove sink states [2018-06-27 03:00:15,345 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-27 03:00:15,345 INFO ]: Using Use SBE [2018-06-27 03:00:15,349 WARN ]: expecting exponential blowup for input size 12 [2018-06-27 03:00:15,957 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 03:00:16,012 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 03:00:16,286 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 03:00:16,287 INFO ]: SBE split 2 edges [2018-06-27 03:00:16,305 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-27 03:00:16,309 INFO ]: 0 new accepting states [2018-06-27 03:00:28,641 INFO ]: Removed 2066 edges and 2 locations by large block encoding [2018-06-27 03:00:28,644 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 03:00:28,657 INFO ]: Removed 12 edges and 0 locations because of local infeasibility [2018-06-27 03:00:28,658 INFO ]: 0 new accepting states [2018-06-27 03:00:28,659 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 03:00:28,659 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 03:00:28,665 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-27 03:00:28,666 INFO ]: 0 new accepting states [2018-06-27 03:00:28,668 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 03:00:28,668 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 03:00:28,677 INFO ]: Encoded RCFG 6 locations, 2056 edges [2018-06-27 03:00:28,677 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 03:00:28 BasicIcfg [2018-06-27 03:00:28,677 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-27 03:00:28,678 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-27 03:00:28,678 INFO ]: Initializing TraceAbstraction... [2018-06-27 03:00:28,681 INFO ]: TraceAbstraction initialized [2018-06-27 03:00:28,682 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 03:00:14" (1/4) ... [2018-06-27 03:00:28,682 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284feeda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 27.06 03:00:28, skipping insertion in model container [2018-06-27 03:00:28,682 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:00:14" (2/4) ... [2018-06-27 03:00:28,683 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284feeda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 03:00:28, skipping insertion in model container [2018-06-27 03:00:28,683 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 03:00:15" (3/4) ... [2018-06-27 03:00:28,683 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284feeda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 03:00:28, skipping insertion in model container [2018-06-27 03:00:28,683 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 03:00:28" (4/4) ... [2018-06-27 03:00:28,684 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-27 03:00:28,692 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-27 03:00:28,699 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-27 03:00:28,736 INFO ]: Using default assertion order modulation [2018-06-27 03:00:28,737 INFO ]: Interprodecural is true [2018-06-27 03:00:28,737 INFO ]: Hoare is false [2018-06-27 03:00:28,737 INFO ]: Compute interpolants for FPandBP [2018-06-27 03:00:28,737 INFO ]: Backedges is TWOTRACK [2018-06-27 03:00:28,737 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-27 03:00:28,737 INFO ]: Difference is false [2018-06-27 03:00:28,737 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-27 03:00:28,737 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-27 03:00:28,756 INFO ]: Start isEmpty. Operand 6 states. [2018-06-27 03:00:28,772 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:00:28,772 INFO ]: Found error trace [2018-06-27 03:00:28,773 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:00:28,773 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:28,778 INFO ]: Analyzing trace with hash 161085025, now seen corresponding path program 1 times [2018-06-27 03:00:28,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:28,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:28,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:28,827 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:28,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:28,869 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:28,989 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:28,992 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:28,992 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:28,994 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:29,009 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:29,009 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:29,011 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-27 03:00:32,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:32,120 INFO ]: Finished difference Result 7 states and 2057 transitions. [2018-06-27 03:00:32,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:32,121 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:00:32,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:32,137 INFO ]: With dead ends: 7 [2018-06-27 03:00:32,137 INFO ]: Without dead ends: 7 [2018-06-27 03:00:32,139 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-27 03:00:32,156 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:00:32,225 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:00:32,227 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:32,231 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-27 03:00:32,232 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-27 03:00:32,233 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:32,233 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-27 03:00:32,233 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:32,233 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-27 03:00:32,234 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:00:32,234 INFO ]: Found error trace [2018-06-27 03:00:32,235 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:00:32,235 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:32,235 INFO ]: Analyzing trace with hash 161174398, now seen corresponding path program 1 times [2018-06-27 03:00:32,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:32,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:32,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:32,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:32,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:32,262 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:32,344 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:32,344 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:32,344 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:32,346 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:32,346 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:32,346 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:32,346 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-27 03:00:34,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:34,909 INFO ]: Finished difference Result 9 states and 2059 transitions. [2018-06-27 03:00:34,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:34,910 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:00:34,910 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:34,912 INFO ]: With dead ends: 9 [2018-06-27 03:00:34,912 INFO ]: Without dead ends: 9 [2018-06-27 03:00:34,913 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-27 03:00:34,913 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 03:00:34,926 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 03:00:34,926 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:34,930 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-27 03:00:34,930 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-27 03:00:34,930 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:34,930 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-27 03:00:34,930 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:34,930 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-27 03:00:34,932 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:00:34,932 INFO ]: Found error trace [2018-06-27 03:00:34,932 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:00:34,932 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:34,932 INFO ]: Analyzing trace with hash 161204189, now seen corresponding path program 1 times [2018-06-27 03:00:34,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:34,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:34,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:34,933 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:34,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:34,941 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:34,997 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:34,997 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:34,997 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:34,997 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:34,997 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:34,998 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:34,998 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-27 03:00:37,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:37,466 INFO ]: Finished difference Result 9 states and 2059 transitions. [2018-06-27 03:00:37,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:37,467 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:00:37,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:37,470 INFO ]: With dead ends: 9 [2018-06-27 03:00:37,470 INFO ]: Without dead ends: 9 [2018-06-27 03:00:37,470 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-27 03:00:37,470 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 03:00:37,483 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 03:00:37,483 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:37,487 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-27 03:00:37,487 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-27 03:00:37,487 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:37,487 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-27 03:00:37,487 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:37,487 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-27 03:00:37,489 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:00:37,489 INFO ]: Found error trace [2018-06-27 03:00:37,489 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:00:37,489 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:37,489 INFO ]: Analyzing trace with hash 161233980, now seen corresponding path program 1 times [2018-06-27 03:00:37,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:37,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:37,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:37,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:37,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:37,504 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:37,533 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:37,533 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:37,533 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:37,533 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:37,533 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:37,533 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:37,533 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-27 03:00:39,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:39,482 INFO ]: Finished difference Result 9 states and 2059 transitions. [2018-06-27 03:00:39,483 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:39,483 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:00:39,483 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:39,485 INFO ]: With dead ends: 9 [2018-06-27 03:00:39,485 INFO ]: Without dead ends: 9 [2018-06-27 03:00:39,485 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-27 03:00:39,485 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 03:00:39,497 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 03:00:39,497 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:39,500 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-27 03:00:39,500 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-27 03:00:39,500 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:39,500 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-27 03:00:39,500 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:39,500 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-27 03:00:39,501 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:00:39,501 INFO ]: Found error trace [2018-06-27 03:00:39,501 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:00:39,501 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:39,502 INFO ]: Analyzing trace with hash 161680845, now seen corresponding path program 1 times [2018-06-27 03:00:39,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:39,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:39,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:39,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:39,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:39,516 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:39,594 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:39,594 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:39,594 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:39,595 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:39,595 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:39,595 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:39,595 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-27 03:00:41,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:41,257 INFO ]: Finished difference Result 8 states and 2058 transitions. [2018-06-27 03:00:41,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:41,257 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:00:41,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:41,258 INFO ]: With dead ends: 8 [2018-06-27 03:00:41,259 INFO ]: Without dead ends: 8 [2018-06-27 03:00:41,259 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-27 03:00:41,259 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 03:00:41,267 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-27 03:00:41,267 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:41,270 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-27 03:00:41,270 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-27 03:00:41,270 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:41,270 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-27 03:00:41,270 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:41,270 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-27 03:00:41,271 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:00:41,271 INFO ]: Found error trace [2018-06-27 03:00:41,271 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:00:41,271 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:41,271 INFO ]: Analyzing trace with hash 579709331, now seen corresponding path program 1 times [2018-06-27 03:00:41,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:41,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:41,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:41,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:41,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:41,310 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:41,368 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:41,368 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:41,368 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:41,368 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:41,368 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:41,368 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:41,369 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-27 03:00:42,988 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:42,988 INFO ]: Finished difference Result 8 states and 2057 transitions. [2018-06-27 03:00:43,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:43,023 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:00:43,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:43,024 INFO ]: With dead ends: 8 [2018-06-27 03:00:43,024 INFO ]: Without dead ends: 7 [2018-06-27 03:00:43,024 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-27 03:00:43,025 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:00:43,030 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:00:43,030 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:43,032 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions. [2018-06-27 03:00:43,032 INFO ]: Start accepts. Automaton has 7 states and 1033 transitions. Word has length 6 [2018-06-27 03:00:43,032 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:43,032 INFO ]: Abstraction has 7 states and 1033 transitions. [2018-06-27 03:00:43,032 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:43,032 INFO ]: Start isEmpty. Operand 7 states and 1033 transitions. [2018-06-27 03:00:43,032 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:00:43,032 INFO ]: Found error trace [2018-06-27 03:00:43,032 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:00:43,033 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:43,033 INFO ]: Analyzing trace with hash 580632852, now seen corresponding path program 1 times [2018-06-27 03:00:43,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:43,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:43,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:43,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:43,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:43,059 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:43,104 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:43,104 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:43,104 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:43,105 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:43,105 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:43,105 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:43,105 INFO ]: Start difference. First operand 7 states and 1033 transitions. Second operand 3 states. [2018-06-27 03:00:44,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:44,003 INFO ]: Finished difference Result 8 states and 1033 transitions. [2018-06-27 03:00:44,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:44,008 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:00:44,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:44,008 INFO ]: With dead ends: 8 [2018-06-27 03:00:44,009 INFO ]: Without dead ends: 7 [2018-06-27 03:00:44,009 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-27 03:00:44,009 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:00:44,011 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:00:44,011 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:44,012 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 521 transitions. [2018-06-27 03:00:44,012 INFO ]: Start accepts. Automaton has 7 states and 521 transitions. Word has length 6 [2018-06-27 03:00:44,012 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:44,012 INFO ]: Abstraction has 7 states and 521 transitions. [2018-06-27 03:00:44,012 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:44,012 INFO ]: Start isEmpty. Operand 7 states and 521 transitions. [2018-06-27 03:00:44,012 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:00:44,012 INFO ]: Found error trace [2018-06-27 03:00:44,012 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:00:44,012 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:44,012 INFO ]: Analyzing trace with hash 583403415, now seen corresponding path program 1 times [2018-06-27 03:00:44,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:44,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:44,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:44,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:44,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:44,025 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:44,056 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:44,057 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:44,057 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:44,057 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:44,057 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:44,057 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:44,057 INFO ]: Start difference. First operand 7 states and 521 transitions. Second operand 3 states. [2018-06-27 03:00:44,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:44,473 INFO ]: Finished difference Result 8 states and 521 transitions. [2018-06-27 03:00:44,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:44,473 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:00:44,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:44,474 INFO ]: With dead ends: 8 [2018-06-27 03:00:44,474 INFO ]: Without dead ends: 7 [2018-06-27 03:00:44,474 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-27 03:00:44,474 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:00:44,476 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:00:44,476 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:44,476 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 393 transitions. [2018-06-27 03:00:44,476 INFO ]: Start accepts. Automaton has 7 states and 393 transitions. Word has length 6 [2018-06-27 03:00:44,476 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:44,476 INFO ]: Abstraction has 7 states and 393 transitions. [2018-06-27 03:00:44,476 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:44,476 INFO ]: Start isEmpty. Operand 7 states and 393 transitions. [2018-06-27 03:00:44,476 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:00:44,476 INFO ]: Found error trace [2018-06-27 03:00:44,476 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:00:44,476 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:44,476 INFO ]: Analyzing trace with hash -838818925, now seen corresponding path program 1 times [2018-06-27 03:00:44,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:44,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:44,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:44,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:44,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:44,495 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:44,524 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:44,524 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:44,524 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:44,524 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:44,524 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:44,524 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:44,524 INFO ]: Start difference. First operand 7 states and 393 transitions. Second operand 3 states. [2018-06-27 03:00:44,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:44,833 INFO ]: Finished difference Result 8 states and 393 transitions. [2018-06-27 03:00:44,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:44,833 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:00:44,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:44,834 INFO ]: With dead ends: 8 [2018-06-27 03:00:44,834 INFO ]: Without dead ends: 7 [2018-06-27 03:00:44,834 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-27 03:00:44,834 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:00:44,835 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:00:44,835 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:44,836 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 265 transitions. [2018-06-27 03:00:44,836 INFO ]: Start accepts. Automaton has 7 states and 265 transitions. Word has length 6 [2018-06-27 03:00:44,836 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:44,836 INFO ]: Abstraction has 7 states and 265 transitions. [2018-06-27 03:00:44,836 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:44,836 INFO ]: Start isEmpty. Operand 7 states and 265 transitions. [2018-06-27 03:00:44,836 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:00:44,836 INFO ]: Found error trace [2018-06-27 03:00:44,836 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:00:44,836 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:44,836 INFO ]: Analyzing trace with hash 109637142, now seen corresponding path program 1 times [2018-06-27 03:00:44,836 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:44,836 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:44,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:44,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:44,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:44,857 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:44,953 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:44,953 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:44,953 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:44,954 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:44,954 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:44,954 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:44,954 INFO ]: Start difference. First operand 7 states and 265 transitions. Second operand 3 states. [2018-06-27 03:00:45,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:45,161 INFO ]: Finished difference Result 8 states and 265 transitions. [2018-06-27 03:00:45,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:45,161 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:00:45,161 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:45,161 INFO ]: With dead ends: 8 [2018-06-27 03:00:45,161 INFO ]: Without dead ends: 7 [2018-06-27 03:00:45,161 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-27 03:00:45,162 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:00:45,162 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:00:45,163 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:45,163 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2018-06-27 03:00:45,163 INFO ]: Start accepts. Automaton has 7 states and 137 transitions. Word has length 6 [2018-06-27 03:00:45,163 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:45,163 INFO ]: Abstraction has 7 states and 137 transitions. [2018-06-27 03:00:45,163 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:45,163 INFO ]: Start isEmpty. Operand 7 states and 137 transitions. [2018-06-27 03:00:45,163 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:00:45,163 INFO ]: Found error trace [2018-06-27 03:00:45,163 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:00:45,163 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:45,163 INFO ]: Analyzing trace with hash -1075240301, now seen corresponding path program 1 times [2018-06-27 03:00:45,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:45,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:45,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:45,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:45,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:45,173 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:45,194 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:45,194 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:45,194 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:45,195 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:45,195 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:45,195 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:45,195 INFO ]: Start difference. First operand 7 states and 137 transitions. Second operand 3 states. [2018-06-27 03:00:45,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:45,303 INFO ]: Finished difference Result 8 states and 137 transitions. [2018-06-27 03:00:45,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:45,303 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 03:00:45,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:45,303 INFO ]: With dead ends: 8 [2018-06-27 03:00:45,303 INFO ]: Without dead ends: 7 [2018-06-27 03:00:45,304 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-27 03:00:45,304 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:00:45,304 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:00:45,305 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:00:45,305 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2018-06-27 03:00:45,305 INFO ]: Start accepts. Automaton has 7 states and 73 transitions. Word has length 6 [2018-06-27 03:00:45,305 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:45,305 INFO ]: Abstraction has 7 states and 73 transitions. [2018-06-27 03:00:45,305 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:45,305 INFO ]: Start isEmpty. Operand 7 states and 73 transitions. [2018-06-27 03:00:45,305 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 03:00:45,305 INFO ]: Found error trace [2018-06-27 03:00:45,305 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 03:00:45,305 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:45,305 INFO ]: Analyzing trace with hash -7650025, now seen corresponding path program 1 times [2018-06-27 03:00:45,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:45,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:45,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:45,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:45,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:45,320 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:45,363 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:45,363 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 03:00:45,363 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-27 03:00:45,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:45,412 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:45,418 INFO ]: Computing forward predicates... [2018-06-27 03:00:45,482 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:45,519 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 03:00:45,519 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-27 03:00:45,519 INFO ]: Interpolant automaton has 4 states [2018-06-27 03:00:45,519 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-27 03:00:45,519 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-27 03:00:45,520 INFO ]: Start difference. First operand 7 states and 73 transitions. Second operand 4 states. [2018-06-27 03:00:46,007 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:46,007 INFO ]: Finished difference Result 9 states and 74 transitions. [2018-06-27 03:00:46,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 03:00:46,008 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-27 03:00:46,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:46,008 INFO ]: With dead ends: 9 [2018-06-27 03:00:46,008 INFO ]: Without dead ends: 8 [2018-06-27 03:00:46,008 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-27 03:00:46,008 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 03:00:46,009 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 03:00:46,009 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 03:00:46,009 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-06-27 03:00:46,010 INFO ]: Start accepts. Automaton has 8 states and 58 transitions. Word has length 6 [2018-06-27 03:00:46,010 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:46,010 INFO ]: Abstraction has 8 states and 58 transitions. [2018-06-27 03:00:46,010 INFO ]: Interpolant automaton has 4 states. [2018-06-27 03:00:46,010 INFO ]: Start isEmpty. Operand 8 states and 58 transitions. [2018-06-27 03:00:46,010 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 03:00:46,010 INFO ]: Found error trace [2018-06-27 03:00:46,010 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 03:00:46,010 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:46,010 INFO ]: Analyzing trace with hash -895306624, now seen corresponding path program 1 times [2018-06-27 03:00:46,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:46,010 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:46,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:46,011 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:46,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:46,045 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:46,068 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-27 03:00:46,068 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:46,068 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:46,068 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:46,068 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:46,068 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:46,068 INFO ]: Start difference. First operand 8 states and 58 transitions. Second operand 3 states. [2018-06-27 03:00:46,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:46,316 INFO ]: Finished difference Result 9 states and 58 transitions. [2018-06-27 03:00:46,316 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:46,316 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-27 03:00:46,316 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:46,317 INFO ]: With dead ends: 9 [2018-06-27 03:00:46,317 INFO ]: Without dead ends: 8 [2018-06-27 03:00:46,317 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-27 03:00:46,317 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 03:00:46,318 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 03:00:46,318 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 03:00:46,318 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2018-06-27 03:00:46,318 INFO ]: Start accepts. Automaton has 8 states and 34 transitions. Word has length 7 [2018-06-27 03:00:46,318 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:46,318 INFO ]: Abstraction has 8 states and 34 transitions. [2018-06-27 03:00:46,318 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:46,318 INFO ]: Start isEmpty. Operand 8 states and 34 transitions. [2018-06-27 03:00:46,318 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 03:00:46,318 INFO ]: Found error trace [2018-06-27 03:00:46,318 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 03:00:46,319 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:46,319 INFO ]: Analyzing trace with hash -184929663, now seen corresponding path program 1 times [2018-06-27 03:00:46,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:46,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:46,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:46,319 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:46,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:46,331 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:46,398 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-27 03:00:46,398 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:46,399 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:46,399 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:46,399 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:46,399 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:46,399 INFO ]: Start difference. First operand 8 states and 34 transitions. Second operand 3 states. [2018-06-27 03:00:46,427 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:46,427 INFO ]: Finished difference Result 9 states and 34 transitions. [2018-06-27 03:00:46,427 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:46,427 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-27 03:00:46,427 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:46,427 INFO ]: With dead ends: 9 [2018-06-27 03:00:46,427 INFO ]: Without dead ends: 8 [2018-06-27 03:00:46,428 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-27 03:00:46,428 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 03:00:46,429 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 03:00:46,429 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 03:00:46,429 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-06-27 03:00:46,429 INFO ]: Start accepts. Automaton has 8 states and 26 transitions. Word has length 7 [2018-06-27 03:00:46,429 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:46,429 INFO ]: Abstraction has 8 states and 26 transitions. [2018-06-27 03:00:46,429 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:46,429 INFO ]: Start isEmpty. Operand 8 states and 26 transitions. [2018-06-27 03:00:46,429 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 03:00:46,429 INFO ]: Found error trace [2018-06-27 03:00:46,429 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 03:00:46,429 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:46,429 INFO ]: Analyzing trace with hash -97258272, now seen corresponding path program 1 times [2018-06-27 03:00:46,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:46,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:46,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:46,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:46,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:46,452 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:46,564 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-27 03:00:46,564 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:46,564 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:46,565 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:46,565 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:46,565 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:46,565 INFO ]: Start difference. First operand 8 states and 26 transitions. Second operand 3 states. [2018-06-27 03:00:46,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:46,820 INFO ]: Finished difference Result 9 states and 26 transitions. [2018-06-27 03:00:46,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:46,820 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-27 03:00:46,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:46,820 INFO ]: With dead ends: 9 [2018-06-27 03:00:46,820 INFO ]: Without dead ends: 8 [2018-06-27 03:00:46,821 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-27 03:00:46,821 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 03:00:46,822 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 03:00:46,822 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 03:00:46,822 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-06-27 03:00:46,822 INFO ]: Start accepts. Automaton has 8 states and 18 transitions. Word has length 7 [2018-06-27 03:00:46,822 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:46,822 INFO ]: Abstraction has 8 states and 18 transitions. [2018-06-27 03:00:46,822 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:46,822 INFO ]: Start isEmpty. Operand 8 states and 18 transitions. [2018-06-27 03:00:46,822 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 03:00:46,822 INFO ]: Found error trace [2018-06-27 03:00:46,822 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 03:00:46,822 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:46,822 INFO ]: Analyzing trace with hash -1846609713, now seen corresponding path program 1 times [2018-06-27 03:00:46,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:46,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:46,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:46,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:46,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:46,839 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:46,957 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-27 03:00:46,957 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:00:46,957 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:00:46,957 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:00:46,957 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:00:46,957 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:00:46,957 INFO ]: Start difference. First operand 8 states and 18 transitions. Second operand 3 states. [2018-06-27 03:00:47,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:47,113 INFO ]: Finished difference Result 9 states and 18 transitions. [2018-06-27 03:00:47,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:00:47,113 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-27 03:00:47,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:47,114 INFO ]: With dead ends: 9 [2018-06-27 03:00:47,114 INFO ]: Without dead ends: 8 [2018-06-27 03:00:47,114 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-27 03:00:47,114 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 03:00:47,114 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 03:00:47,114 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 03:00:47,115 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-27 03:00:47,115 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 7 [2018-06-27 03:00:47,115 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:47,115 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-27 03:00:47,115 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:00:47,115 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-27 03:00:47,115 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 03:00:47,115 INFO ]: Found error trace [2018-06-27 03:00:47,115 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 03:00:47,115 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:47,115 INFO ]: Analyzing trace with hash -356109923, now seen corresponding path program 2 times [2018-06-27 03:00:47,115 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:47,115 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:47,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:47,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:47,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:47,133 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:47,401 WARN ]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-27 03:00:47,467 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:47,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 03:00:47,467 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-27 03:00:47,473 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-27 03:00:47,511 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-27 03:00:47,511 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:47,513 INFO ]: Computing forward predicates... [2018-06-27 03:00:47,963 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:47,983 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 03:00:47,983 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 03:00:47,983 INFO ]: Interpolant automaton has 8 states [2018-06-27 03:00:47,983 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 03:00:47,983 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-27 03:00:47,983 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 8 states. [2018-06-27 03:00:48,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:48,140 INFO ]: Finished difference Result 12 states and 17 transitions. [2018-06-27 03:00:48,168 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-27 03:00:48,168 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 03:00:48,168 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:48,168 INFO ]: With dead ends: 12 [2018-06-27 03:00:48,168 INFO ]: Without dead ends: 8 [2018-06-27 03:00:48,168 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-27 03:00:48,168 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 03:00:48,169 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 03:00:48,169 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 03:00:48,169 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-27 03:00:48,169 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2018-06-27 03:00:48,169 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:48,169 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-27 03:00:48,169 INFO ]: Interpolant automaton has 8 states. [2018-06-27 03:00:48,169 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-27 03:00:48,170 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 03:00:48,170 INFO ]: Found error trace [2018-06-27 03:00:48,170 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 03:00:48,170 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:00:48,170 INFO ]: Analyzing trace with hash -156895158, now seen corresponding path program 1 times [2018-06-27 03:00:48,170 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:00:48,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:00:48,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:48,170 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-27 03:00:48,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:00:48,183 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:48,477 WARN ]: Spent 245.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-06-27 03:00:48,509 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:48,509 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 03:00:48,509 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 03:00:48,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:00:48,552 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:00:48,554 INFO ]: Computing forward predicates... [2018-06-27 03:00:48,647 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:00:48,671 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 03:00:48,671 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 03:00:48,671 INFO ]: Interpolant automaton has 8 states [2018-06-27 03:00:48,671 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 03:00:48,671 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-27 03:00:48,672 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 8 states. [2018-06-27 03:00:48,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:00:48,777 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-27 03:00:48,777 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-27 03:00:48,777 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 03:00:48,777 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:00:48,777 INFO ]: With dead ends: 4 [2018-06-27 03:00:48,777 INFO ]: Without dead ends: 0 [2018-06-27 03:00:48,778 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-27 03:00:48,778 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-27 03:00:48,778 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-27 03:00:48,778 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-27 03:00:48,778 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-27 03:00:48,778 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-27 03:00:48,778 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:00:48,778 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-27 03:00:48,778 INFO ]: Interpolant automaton has 8 states. [2018-06-27 03:00:48,778 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-27 03:00:48,778 INFO ]: Finished isEmpty. No accepting run. [2018-06-27 03:00:48,779 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-27 03:00:48,781 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 03:00:48 BasicIcfg [2018-06-27 03:00:48,781 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-27 03:00:48,781 INFO ]: Toolchain (without parser) took 33888.51 ms. Allocated memory was 308.8 MB in the beginning and 1.2 GB in the end (delta: 844.6 MB). Free memory was 261.2 MB in the beginning and 426.6 MB in the end (delta: -165.4 MB). Peak memory consumption was 679.2 MB. Max. memory is 3.6 GB. [2018-06-27 03:00:48,782 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 03:00:48,782 INFO ]: ChcToBoogie took 66.43 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 257.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-27 03:00:48,783 INFO ]: Boogie Preprocessor took 39.42 ms. Allocated memory is still 308.8 MB. Free memory is still 257.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 03:00:48,785 INFO ]: RCFGBuilder took 311.11 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 243.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-27 03:00:48,785 INFO ]: BlockEncodingV2 took 13356.03 ms. Allocated memory was 308.8 MB in the beginning and 803.7 MB in the end (delta: 494.9 MB). Free memory was 243.2 MB in the beginning and 573.1 MB in the end (delta: -329.9 MB). Peak memory consumption was 456.1 MB. Max. memory is 3.6 GB. [2018-06-27 03:00:48,786 INFO ]: TraceAbstraction took 20102.42 ms. Allocated memory was 803.7 MB in the beginning and 1.2 GB in the end (delta: 349.7 MB). Free memory was 573.1 MB in the beginning and 426.6 MB in the end (delta: 146.4 MB). Peak memory consumption was 496.1 MB. Max. memory is 3.6 GB. [2018-06-27 03:00:48,789 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, 2056 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.43 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 257.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.42 ms. Allocated memory is still 308.8 MB. Free memory is still 257.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 311.11 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 243.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 13356.03 ms. Allocated memory was 308.8 MB in the beginning and 803.7 MB in the end (delta: 494.9 MB). Free memory was 243.2 MB in the beginning and 573.1 MB in the end (delta: -329.9 MB). Peak memory consumption was 456.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 20102.42 ms. Allocated memory was 803.7 MB in the beginning and 1.2 GB in the end (delta: 349.7 MB). Free memory was 573.1 MB in the beginning and 426.6 MB in the end (delta: 146.4 MB). Peak memory consumption was 496.1 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, 20.0s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 16.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14889 SDtfs, 0 SDslu, 75 SDs, 0 SdLazy, 6712 SolverSat, 8270 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 1211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 735 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 18/32 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_e8_449_e7_353.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-27_03-00-48-798.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e7_353.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-27_03-00-48-798.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e7_353.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-27_03-00-48-798.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e7_353.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-27_03-00-48-798.csv Received shutdown request...