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_e8_517.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 06:57:33,975 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 06:57:33,977 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 06:57:33,988 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 06:57:33,988 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 06:57:33,989 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 06:57:33,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 06:57:33,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 06:57:33,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 06:57:33,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 06:57:33,997 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 06:57:33,997 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 06:57:33,998 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 06:57:33,999 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 06:57:34,000 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 06:57:34,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 06:57:34,003 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 06:57:34,015 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 06:57:34,017 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 06:57:34,018 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 06:57:34,019 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 06:57:34,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 06:57:34,022 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 06:57:34,022 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 06:57:34,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 06:57:34,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 06:57:34,031 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 06:57:34,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 06:57:34,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 06:57:34,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 06:57:34,033 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 06:57:34,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 06:57:34,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 06:57:34,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 06:57:34,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 06:57:34,036 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:57:34,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 06:57:34,063 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 06:57:34,063 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 06:57:34,063 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 06:57:34,065 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 06:57:34,066 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 06:57:34,066 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 06:57:34,066 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 06:57:34,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 06:57:34,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 06:57:34,067 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 06:57:34,067 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 06:57:34,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:57:34,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 06:57:34,067 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 06:57:34,068 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 06:57:34,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 06:57:34,068 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 06:57:34,068 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 06:57:34,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 06:57:34,068 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 06:57:34,071 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 06:57:34,071 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 06:57:34,125 INFO ]: Repository-Root is: /tmp [2018-06-25 06:57:34,144 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 06:57:34,153 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 06:57:34,154 INFO ]: Initializing SmtParser... [2018-06-25 06:57:34,154 INFO ]: SmtParser initialized [2018-06-25 06:57:34,155 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e8_517.smt2 [2018-06-25 06:57:34,156 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:57:34,248 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e8_517.smt2 unknown [2018-06-25 06:57:34,612 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e8_517.smt2 [2018-06-25 06:57:34,616 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 06:57:34,623 INFO ]: Walking toolchain with 5 elements. [2018-06-25 06:57:34,623 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 06:57:34,623 INFO ]: Initializing ChcToBoogie... [2018-06-25 06:57:34,624 INFO ]: ChcToBoogie initialized [2018-06-25 06:57:34,627 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:57:34" (1/1) ... [2018-06-25 06:57:34,687 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:34 Unit [2018-06-25 06:57:34,688 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 06:57:34,688 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 06:57:34,688 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 06:57:34,688 INFO ]: Boogie Preprocessor initialized [2018-06-25 06:57:34,709 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:34" (1/1) ... [2018-06-25 06:57:34,709 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:34" (1/1) ... [2018-06-25 06:57:34,716 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:34" (1/1) ... [2018-06-25 06:57:34,716 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:34" (1/1) ... [2018-06-25 06:57:34,728 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:34" (1/1) ... [2018-06-25 06:57:34,729 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:34" (1/1) ... [2018-06-25 06:57:34,730 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:34" (1/1) ... [2018-06-25 06:57:34,732 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 06:57:34,733 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 06:57:34,733 INFO ]: Initializing RCFGBuilder... [2018-06-25 06:57:34,733 INFO ]: RCFGBuilder initialized [2018-06-25 06:57:34,734 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:34" (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:57:34,743 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 06:57:34,743 INFO ]: Found specification of procedure gotoProc [2018-06-25 06:57:34,743 INFO ]: Found implementation of procedure gotoProc [2018-06-25 06:57:34,743 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 06:57:34,743 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 06:57:34,743 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:57:35,027 INFO ]: Using library mode [2018-06-25 06:57:35,027 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:57:35 BoogieIcfgContainer [2018-06-25 06:57:35,027 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 06:57:35,031 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 06:57:35,031 INFO ]: Initializing BlockEncodingV2... [2018-06-25 06:57:35,032 INFO ]: BlockEncodingV2 initialized [2018-06-25 06:57:35,033 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:57:35" (1/1) ... [2018-06-25 06:57:35,050 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 06:57:35,051 INFO ]: Using Remove infeasible edges [2018-06-25 06:57:35,051 INFO ]: Using Maximize final states [2018-06-25 06:57:35,052 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 06:57:35,052 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 06:57:35,054 INFO ]: Using Remove sink states [2018-06-25 06:57:35,055 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 06:57:35,055 INFO ]: Using Use SBE [2018-06-25 06:57:35,065 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:57:37,115 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:57:37,741 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:57:37,993 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:57:37,994 INFO ]: SBE split 2 edges [2018-06-25 06:57:38,013 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 06:57:38,017 INFO ]: 0 new accepting states [2018-06-25 06:57:50,520 INFO ]: Removed 2067 edges and 2 locations by large block encoding [2018-06-25 06:57:50,523 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:50,539 INFO ]: Removed 12 edges and 0 locations because of local infeasibility [2018-06-25 06:57:50,541 INFO ]: 0 new accepting states [2018-06-25 06:57:50,543 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:57:50,543 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:50,550 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 06:57:50,552 INFO ]: 0 new accepting states [2018-06-25 06:57:50,555 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:57:50,555 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:50,565 INFO ]: Encoded RCFG 6 locations, 2057 edges [2018-06-25 06:57:50,565 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:57:50 BasicIcfg [2018-06-25 06:57:50,565 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 06:57:50,567 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 06:57:50,567 INFO ]: Initializing TraceAbstraction... [2018-06-25 06:57:50,570 INFO ]: TraceAbstraction initialized [2018-06-25 06:57:50,570 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:57:34" (1/4) ... [2018-06-25 06:57:50,571 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7551d6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 06:57:50, skipping insertion in model container [2018-06-25 06:57:50,571 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:34" (2/4) ... [2018-06-25 06:57:50,571 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7551d6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 06:57:50, skipping insertion in model container [2018-06-25 06:57:50,571 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:57:35" (3/4) ... [2018-06-25 06:57:50,571 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7551d6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:57:50, skipping insertion in model container [2018-06-25 06:57:50,571 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:57:50" (4/4) ... [2018-06-25 06:57:50,573 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 06:57:50,581 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 06:57:50,587 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 06:57:50,644 INFO ]: Using default assertion order modulation [2018-06-25 06:57:50,644 INFO ]: Interprodecural is true [2018-06-25 06:57:50,644 INFO ]: Hoare is false [2018-06-25 06:57:50,644 INFO ]: Compute interpolants for FPandBP [2018-06-25 06:57:50,644 INFO ]: Backedges is TWOTRACK [2018-06-25 06:57:50,644 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 06:57:50,644 INFO ]: Difference is false [2018-06-25 06:57:50,644 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 06:57:50,644 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 06:57:50,667 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 06:57:50,687 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:50,687 INFO ]: Found error trace [2018-06-25 06:57:50,688 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:50,688 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:50,693 INFO ]: Analyzing trace with hash 161085025, now seen corresponding path program 1 times [2018-06-25 06:57:50,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:50,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:50,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:50,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:50,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:50,786 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:50,872 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:57:50,875 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:50,875 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:50,877 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:50,893 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:50,893 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:50,895 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 06:57:54,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:54,058 INFO ]: Finished difference Result 7 states and 2058 transitions. [2018-06-25 06:57:54,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:54,059 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:54,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:54,073 INFO ]: With dead ends: 7 [2018-06-25 06:57:54,073 INFO ]: Without dead ends: 7 [2018-06-25 06:57:54,074 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:57:54,092 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:54,153 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:54,155 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:54,158 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:57:54,159 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:57:54,160 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:54,160 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:57:54,160 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:54,160 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:57:54,162 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:54,162 INFO ]: Found error trace [2018-06-25 06:57:54,162 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:54,162 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:54,162 INFO ]: Analyzing trace with hash 161114816, now seen corresponding path program 1 times [2018-06-25 06:57:54,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:54,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:54,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:54,163 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:54,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:54,172 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:54,231 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:57:54,232 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:54,232 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:54,233 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:54,233 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:54,233 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:54,233 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:57:56,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:56,620 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:57:56,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:56,620 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:56,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:56,623 INFO ]: With dead ends: 9 [2018-06-25 06:57:56,623 INFO ]: Without dead ends: 9 [2018-06-25 06:57:56,624 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:57:56,624 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:57:56,637 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:57:56,637 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:56,639 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:57:56,639 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:57:56,639 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:56,639 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:57:56,639 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:56,639 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:57:56,641 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:56,641 INFO ]: Found error trace [2018-06-25 06:57:56,641 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:56,641 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:56,641 INFO ]: Analyzing trace with hash 161233980, now seen corresponding path program 1 times [2018-06-25 06:57:56,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:56,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:56,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:56,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:56,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:56,655 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:56,690 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:57:56,690 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:56,690 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:56,690 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:56,690 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:56,690 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:56,690 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:57:59,859 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:59,859 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:57:59,860 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:59,860 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:59,860 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:59,863 INFO ]: With dead ends: 9 [2018-06-25 06:57:59,864 INFO ]: Without dead ends: 9 [2018-06-25 06:57:59,864 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:57:59,864 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:57:59,877 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:57:59,877 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:59,881 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:57:59,881 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:57:59,881 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:59,881 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:57:59,881 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:59,881 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:57:59,884 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:59,884 INFO ]: Found error trace [2018-06-25 06:57:59,884 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:59,884 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:59,884 INFO ]: Analyzing trace with hash 161382935, now seen corresponding path program 1 times [2018-06-25 06:57:59,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:59,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:59,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:59,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:59,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:59,897 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:59,967 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:57:59,967 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:59,967 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:59,967 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:59,967 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:59,967 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:59,967 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:01,624 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:01,624 INFO ]: Finished difference Result 10 states and 2064 transitions. [2018-06-25 06:58:01,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:01,624 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:01,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:01,627 INFO ]: With dead ends: 10 [2018-06-25 06:58:01,627 INFO ]: Without dead ends: 10 [2018-06-25 06:58:01,628 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:01,628 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 06:58:01,639 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 06:58:01,640 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:58:01,643 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2062 transitions. [2018-06-25 06:58:01,643 INFO ]: Start accepts. Automaton has 8 states and 2062 transitions. Word has length 5 [2018-06-25 06:58:01,644 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:01,644 INFO ]: Abstraction has 8 states and 2062 transitions. [2018-06-25 06:58:01,644 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:01,644 INFO ]: Start isEmpty. Operand 8 states and 2062 transitions. [2018-06-25 06:58:01,645 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:01,645 INFO ]: Found error trace [2018-06-25 06:58:01,645 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:01,645 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:01,645 INFO ]: Analyzing trace with hash 161385818, now seen corresponding path program 1 times [2018-06-25 06:58:01,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:01,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:01,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:01,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:01,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:01,657 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:01,734 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:01,734 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:01,734 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:01,734 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:01,734 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:01,734 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:01,734 INFO ]: Start difference. First operand 8 states and 2062 transitions. Second operand 3 states. [2018-06-25 06:58:03,313 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:03,313 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:58:03,313 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:03,313 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:03,313 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:03,315 INFO ]: With dead ends: 9 [2018-06-25 06:58:03,315 INFO ]: Without dead ends: 9 [2018-06-25 06:58:03,315 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:03,315 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:03,323 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:58:03,323 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:03,327 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:03,327 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:03,327 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:03,327 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:03,327 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:03,327 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:03,329 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:03,329 INFO ]: Found error trace [2018-06-25 06:58:03,329 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:03,329 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:03,329 INFO ]: Analyzing trace with hash 579709331, now seen corresponding path program 1 times [2018-06-25 06:58:03,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:03,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:03,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:03,330 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:03,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:03,356 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:03,421 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:03,421 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:03,421 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:03,422 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:03,422 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:03,422 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:03,422 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:05,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:05,234 INFO ]: Finished difference Result 8 states and 2058 transitions. [2018-06-25 06:58:05,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:05,234 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:05,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:05,236 INFO ]: With dead ends: 8 [2018-06-25 06:58:05,236 INFO ]: Without dead ends: 7 [2018-06-25 06:58:05,236 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:05,236 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:05,239 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:05,239 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:05,241 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1034 transitions. [2018-06-25 06:58:05,241 INFO ]: Start accepts. Automaton has 7 states and 1034 transitions. Word has length 6 [2018-06-25 06:58:05,241 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:05,241 INFO ]: Abstraction has 7 states and 1034 transitions. [2018-06-25 06:58:05,241 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:05,241 INFO ]: Start isEmpty. Operand 7 states and 1034 transitions. [2018-06-25 06:58:05,242 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:05,242 INFO ]: Found error trace [2018-06-25 06:58:05,242 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:05,242 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:05,242 INFO ]: Analyzing trace with hash 580632852, now seen corresponding path program 1 times [2018-06-25 06:58:05,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:05,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:05,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:05,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:05,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:05,268 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:05,323 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:05,323 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:05,323 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:05,323 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:05,323 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:05,323 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:05,324 INFO ]: Start difference. First operand 7 states and 1034 transitions. Second operand 3 states. [2018-06-25 06:58:06,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:06,191 INFO ]: Finished difference Result 8 states and 1034 transitions. [2018-06-25 06:58:06,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:06,194 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:06,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:06,195 INFO ]: With dead ends: 8 [2018-06-25 06:58:06,195 INFO ]: Without dead ends: 7 [2018-06-25 06:58:06,195 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:06,195 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:06,198 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:06,198 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:06,199 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions. [2018-06-25 06:58:06,199 INFO ]: Start accepts. Automaton has 7 states and 778 transitions. Word has length 6 [2018-06-25 06:58:06,199 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:06,199 INFO ]: Abstraction has 7 states and 778 transitions. [2018-06-25 06:58:06,199 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:06,199 INFO ]: Start isEmpty. Operand 7 states and 778 transitions. [2018-06-25 06:58:06,200 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:06,200 INFO ]: Found error trace [2018-06-25 06:58:06,200 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:06,200 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:06,200 INFO ]: Analyzing trace with hash -365052652, now seen corresponding path program 1 times [2018-06-25 06:58:06,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:06,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:06,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:06,201 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:06,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:06,225 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:06,255 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:06,255 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:06,255 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:06,255 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:06,255 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:06,256 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:06,256 INFO ]: Start difference. First operand 7 states and 778 transitions. Second operand 3 states. [2018-06-25 06:58:06,872 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:06,872 INFO ]: Finished difference Result 8 states and 778 transitions. [2018-06-25 06:58:06,872 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:06,872 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:06,872 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:06,873 INFO ]: With dead ends: 8 [2018-06-25 06:58:06,873 INFO ]: Without dead ends: 7 [2018-06-25 06:58:06,873 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:06,873 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:06,874 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:06,874 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:06,875 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 586 transitions. [2018-06-25 06:58:06,875 INFO ]: Start accepts. Automaton has 7 states and 586 transitions. Word has length 6 [2018-06-25 06:58:06,875 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:06,875 INFO ]: Abstraction has 7 states and 586 transitions. [2018-06-25 06:58:06,875 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:06,875 INFO ]: Start isEmpty. Operand 7 states and 586 transitions. [2018-06-25 06:58:06,875 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:06,875 INFO ]: Found error trace [2018-06-25 06:58:06,876 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:06,876 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:06,876 INFO ]: Analyzing trace with hash -362282089, now seen corresponding path program 1 times [2018-06-25 06:58:06,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:06,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:06,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:06,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:06,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:06,887 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:06,914 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:06,914 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:06,914 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:06,914 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:06,914 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:06,914 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:06,914 INFO ]: Start difference. First operand 7 states and 586 transitions. Second operand 3 states. [2018-06-25 06:58:07,382 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:07,382 INFO ]: Finished difference Result 8 states and 586 transitions. [2018-06-25 06:58:07,382 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:07,382 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:07,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:07,382 INFO ]: With dead ends: 8 [2018-06-25 06:58:07,382 INFO ]: Without dead ends: 7 [2018-06-25 06:58:07,383 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:07,383 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:07,384 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:07,384 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:07,385 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 490 transitions. [2018-06-25 06:58:07,385 INFO ]: Start accepts. Automaton has 7 states and 490 transitions. Word has length 6 [2018-06-25 06:58:07,385 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:07,385 INFO ]: Abstraction has 7 states and 490 transitions. [2018-06-25 06:58:07,385 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:07,385 INFO ]: Start isEmpty. Operand 7 states and 490 transitions. [2018-06-25 06:58:07,385 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:07,385 INFO ]: Found error trace [2018-06-25 06:58:07,385 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:07,385 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:07,385 INFO ]: Analyzing trace with hash 584326936, now seen corresponding path program 1 times [2018-06-25 06:58:07,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:07,386 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:07,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:07,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:07,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:07,398 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:07,483 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:07,483 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:07,483 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:07,483 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:07,483 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:07,483 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:07,484 INFO ]: Start difference. First operand 7 states and 490 transitions. Second operand 3 states. [2018-06-25 06:58:07,934 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:07,934 INFO ]: Finished difference Result 8 states and 490 transitions. [2018-06-25 06:58:07,934 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:07,934 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:07,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:07,935 INFO ]: With dead ends: 8 [2018-06-25 06:58:07,935 INFO ]: Without dead ends: 7 [2018-06-25 06:58:07,935 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:07,935 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:07,936 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:07,936 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:07,937 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 298 transitions. [2018-06-25 06:58:07,937 INFO ]: Start accepts. Automaton has 7 states and 298 transitions. Word has length 6 [2018-06-25 06:58:07,937 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:07,937 INFO ]: Abstraction has 7 states and 298 transitions. [2018-06-25 06:58:07,937 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:07,937 INFO ]: Start isEmpty. Operand 7 states and 298 transitions. [2018-06-25 06:58:07,937 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:07,937 INFO ]: Found error trace [2018-06-25 06:58:07,937 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:07,937 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:07,937 INFO ]: Analyzing trace with hash 114254747, now seen corresponding path program 1 times [2018-06-25 06:58:07,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:07,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:07,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:07,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:07,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:07,961 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:08,033 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:08,034 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:08,034 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:08,034 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:08,034 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:08,034 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:08,034 INFO ]: Start difference. First operand 7 states and 298 transitions. Second operand 3 states. [2018-06-25 06:58:08,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:08,277 INFO ]: Finished difference Result 8 states and 298 transitions. [2018-06-25 06:58:08,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:08,277 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:08,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:08,278 INFO ]: With dead ends: 8 [2018-06-25 06:58:08,278 INFO ]: Without dead ends: 7 [2018-06-25 06:58:08,278 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:08,278 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:08,279 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:08,279 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:08,280 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2018-06-25 06:58:08,280 INFO ]: Start accepts. Automaton has 7 states and 226 transitions. Word has length 6 [2018-06-25 06:58:08,280 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:08,280 INFO ]: Abstraction has 7 states and 226 transitions. [2018-06-25 06:58:08,280 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:08,280 INFO ]: Start isEmpty. Operand 7 states and 226 transitions. [2018-06-25 06:58:08,280 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:08,280 INFO ]: Found error trace [2018-06-25 06:58:08,280 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:08,280 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:08,280 INFO ]: Analyzing trace with hash -828660194, now seen corresponding path program 1 times [2018-06-25 06:58:08,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:08,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:08,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:08,281 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:08,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:08,292 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:08,330 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:08,330 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:08,330 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:08,330 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:08,331 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:08,331 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:08,331 INFO ]: Start difference. First operand 7 states and 226 transitions. Second operand 3 states. [2018-06-25 06:58:08,519 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:08,519 INFO ]: Finished difference Result 8 states and 226 transitions. [2018-06-25 06:58:08,519 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:08,519 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:08,519 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:08,519 INFO ]: With dead ends: 8 [2018-06-25 06:58:08,519 INFO ]: Without dead ends: 7 [2018-06-25 06:58:08,519 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:08,520 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:08,520 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:08,521 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:08,521 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2018-06-25 06:58:08,521 INFO ]: Start accepts. Automaton has 7 states and 154 transitions. Word has length 6 [2018-06-25 06:58:08,521 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:08,521 INFO ]: Abstraction has 7 states and 154 transitions. [2018-06-25 06:58:08,521 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:08,521 INFO ]: Start isEmpty. Operand 7 states and 154 transitions. [2018-06-25 06:58:08,521 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:08,521 INFO ]: Found error trace [2018-06-25 06:58:08,521 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:08,521 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:08,521 INFO ]: Analyzing trace with hash 343287955, now seen corresponding path program 1 times [2018-06-25 06:58:08,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:08,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:08,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:08,522 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:08,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:08,532 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:08,571 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:08,571 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:08,571 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:08,571 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:08,571 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:08,571 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:08,571 INFO ]: Start difference. First operand 7 states and 154 transitions. Second operand 3 states. [2018-06-25 06:58:08,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:08,703 INFO ]: Finished difference Result 8 states and 154 transitions. [2018-06-25 06:58:08,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:08,703 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:08,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:08,703 INFO ]: With dead ends: 8 [2018-06-25 06:58:08,703 INFO ]: Without dead ends: 7 [2018-06-25 06:58:08,703 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:08,704 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:08,704 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:08,704 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:08,705 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2018-06-25 06:58:08,705 INFO ]: Start accepts. Automaton has 7 states and 130 transitions. Word has length 6 [2018-06-25 06:58:08,705 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:08,705 INFO ]: Abstraction has 7 states and 130 transitions. [2018-06-25 06:58:08,705 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:08,705 INFO ]: Start isEmpty. Operand 7 states and 130 transitions. [2018-06-25 06:58:08,705 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:08,705 INFO ]: Found error trace [2018-06-25 06:58:08,705 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:08,705 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:08,705 INFO ]: Analyzing trace with hash -1072469738, now seen corresponding path program 1 times [2018-06-25 06:58:08,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:08,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:08,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:08,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:08,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:08,714 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:08,794 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:08,794 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:08,794 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:08,794 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:08,794 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:08,794 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:08,795 INFO ]: Start difference. First operand 7 states and 130 transitions. Second operand 3 states. [2018-06-25 06:58:08,896 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:08,896 INFO ]: Finished difference Result 8 states and 130 transitions. [2018-06-25 06:58:08,897 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:08,897 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:08,897 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:08,897 INFO ]: With dead ends: 8 [2018-06-25 06:58:08,897 INFO ]: Without dead ends: 7 [2018-06-25 06:58:08,897 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:08,897 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:08,898 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:08,898 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:08,898 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-06-25 06:58:08,898 INFO ]: Start accepts. Automaton has 7 states and 82 transitions. Word has length 6 [2018-06-25 06:58:08,898 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:08,898 INFO ]: Abstraction has 7 states and 82 transitions. [2018-06-25 06:58:08,898 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:08,898 INFO ]: Start isEmpty. Operand 7 states and 82 transitions. [2018-06-25 06:58:08,898 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:08,898 INFO ]: Found error trace [2018-06-25 06:58:08,899 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:08,899 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:08,899 INFO ]: Analyzing trace with hash -955182571, now seen corresponding path program 1 times [2018-06-25 06:58:08,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:08,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:08,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:08,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:08,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:08,907 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:08,963 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:08,963 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:08,963 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:08,963 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:08,963 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:08,963 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:08,963 INFO ]: Start difference. First operand 7 states and 82 transitions. Second operand 3 states. [2018-06-25 06:58:09,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:09,027 INFO ]: Finished difference Result 8 states and 82 transitions. [2018-06-25 06:58:09,028 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:09,028 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:09,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:09,028 INFO ]: With dead ends: 8 [2018-06-25 06:58:09,028 INFO ]: Without dead ends: 7 [2018-06-25 06:58:09,028 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:09,028 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:09,029 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:09,029 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:09,029 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-06-25 06:58:09,029 INFO ]: Start accepts. Automaton has 7 states and 58 transitions. Word has length 6 [2018-06-25 06:58:09,029 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:09,029 INFO ]: Abstraction has 7 states and 58 transitions. [2018-06-25 06:58:09,029 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:09,029 INFO ]: Start isEmpty. Operand 7 states and 58 transitions. [2018-06-25 06:58:09,029 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:09,029 INFO ]: Found error trace [2018-06-25 06:58:09,029 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:09,030 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:09,030 INFO ]: Analyzing trace with hash -184966057, now seen corresponding path program 1 times [2018-06-25 06:58:09,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:09,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:09,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:09,030 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:09,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:09,038 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:09,154 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:09,155 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:09,155 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:09,155 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:09,155 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:09,155 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:09,155 INFO ]: Start difference. First operand 7 states and 58 transitions. Second operand 3 states. [2018-06-25 06:58:09,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:09,226 INFO ]: Finished difference Result 8 states and 58 transitions. [2018-06-25 06:58:09,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:09,227 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:09,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:09,227 INFO ]: With dead ends: 8 [2018-06-25 06:58:09,227 INFO ]: Without dead ends: 7 [2018-06-25 06:58:09,227 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:09,227 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:09,228 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:09,228 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:09,228 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2018-06-25 06:58:09,229 INFO ]: Start accepts. Automaton has 7 states and 46 transitions. Word has length 6 [2018-06-25 06:58:09,229 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:09,229 INFO ]: Abstraction has 7 states and 46 transitions. [2018-06-25 06:58:09,229 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:09,229 INFO ]: Start isEmpty. Operand 7 states and 46 transitions. [2018-06-25 06:58:09,229 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:09,229 INFO ]: Found error trace [2018-06-25 06:58:09,229 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:09,229 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:09,229 INFO ]: Analyzing trace with hash 466116248, now seen corresponding path program 1 times [2018-06-25 06:58:09,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:09,229 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:09,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:09,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:09,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:09,249 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:09,367 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:09,367 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:09,367 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:09,367 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:09,367 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:09,367 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:09,367 INFO ]: Start difference. First operand 7 states and 46 transitions. Second operand 3 states. [2018-06-25 06:58:09,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:09,895 INFO ]: Finished difference Result 8 states and 46 transitions. [2018-06-25 06:58:09,896 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:09,896 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:09,896 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:09,896 INFO ]: With dead ends: 8 [2018-06-25 06:58:09,896 INFO ]: Without dead ends: 7 [2018-06-25 06:58:09,896 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:58:09,896 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:09,897 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:09,897 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:09,897 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-06-25 06:58:09,897 INFO ]: Start accepts. Automaton has 7 states and 34 transitions. Word has length 6 [2018-06-25 06:58:09,897 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:09,898 INFO ]: Abstraction has 7 states and 34 transitions. [2018-06-25 06:58:09,898 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:09,898 INFO ]: Start isEmpty. Operand 7 states and 34 transitions. [2018-06-25 06:58:09,898 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:09,898 INFO ]: Found error trace [2018-06-25 06:58:09,898 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:09,898 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:09,898 INFO ]: Analyzing trace with hash -809266253, now seen corresponding path program 1 times [2018-06-25 06:58:09,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:09,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:09,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:09,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:09,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:09,907 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:10,016 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:10,017 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:10,017 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:10,017 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:10,017 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:10,017 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:10,017 INFO ]: Start difference. First operand 7 states and 34 transitions. Second operand 3 states. [2018-06-25 06:58:10,383 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:10,383 INFO ]: Finished difference Result 8 states and 34 transitions. [2018-06-25 06:58:10,383 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:10,383 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:10,383 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:10,384 INFO ]: With dead ends: 8 [2018-06-25 06:58:10,384 INFO ]: Without dead ends: 7 [2018-06-25 06:58:10,384 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:58:10,384 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:10,384 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:10,384 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:10,385 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2018-06-25 06:58:10,385 INFO ]: Start accepts. Automaton has 7 states and 26 transitions. Word has length 6 [2018-06-25 06:58:10,385 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:10,385 INFO ]: Abstraction has 7 states and 26 transitions. [2018-06-25 06:58:10,385 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:10,385 INFO ]: Start isEmpty. Operand 7 states and 26 transitions. [2018-06-25 06:58:10,385 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:10,385 INFO ]: Found error trace [2018-06-25 06:58:10,385 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:10,385 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:10,385 INFO ]: Analyzing trace with hash 492898357, now seen corresponding path program 1 times [2018-06-25 06:58:10,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:10,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:10,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:10,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:10,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:10,406 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:10,586 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 06:58:10,739 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 06:58:10,740 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:58:10,740 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:10,740 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:58:10,756 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:10,812 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:10,821 INFO ]: Computing forward predicates... [2018-06-25 06:58:11,662 WARN ]: Spent 467.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-06-25 06:58:11,675 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:58:11,706 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:11,706 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:58:11,706 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:58:11,706 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:58:11,706 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:58:11,706 INFO ]: Start difference. First operand 7 states and 26 transitions. Second operand 6 states. [2018-06-25 06:58:12,010 WARN ]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-25 06:58:12,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:12,863 INFO ]: Finished difference Result 12 states and 31 transitions. [2018-06-25 06:58:12,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 06:58:12,863 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:58:12,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:12,864 INFO ]: With dead ends: 12 [2018-06-25 06:58:12,864 INFO ]: Without dead ends: 7 [2018-06-25 06:58:12,864 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-25 06:58:12,864 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:12,865 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:12,865 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:12,865 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-06-25 06:58:12,865 INFO ]: Start accepts. Automaton has 7 states and 18 transitions. Word has length 6 [2018-06-25 06:58:12,865 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:12,865 INFO ]: Abstraction has 7 states and 18 transitions. [2018-06-25 06:58:12,865 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:58:12,865 INFO ]: Start isEmpty. Operand 7 states and 18 transitions. [2018-06-25 06:58:12,865 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:12,865 INFO ]: Found error trace [2018-06-25 06:58:12,865 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:12,865 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:12,866 INFO ]: Analyzing trace with hash 141960377, now seen corresponding path program 1 times [2018-06-25 06:58:12,866 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:12,866 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:12,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:12,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:12,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:12,887 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:12,976 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:58:12,976 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:12,976 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:58:12,982 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:13,025 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:13,028 INFO ]: Computing forward predicates... [2018-06-25 06:58:13,061 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:58:13,093 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:13,093 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 06:58:13,093 INFO ]: Interpolant automaton has 4 states [2018-06-25 06:58:13,093 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 06:58:13,093 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 06:58:13,093 INFO ]: Start difference. First operand 7 states and 18 transitions. Second operand 4 states. [2018-06-25 06:58:13,127 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:13,127 INFO ]: Finished difference Result 9 states and 20 transitions. [2018-06-25 06:58:13,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:58:13,127 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 06:58:13,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:13,128 INFO ]: With dead ends: 9 [2018-06-25 06:58:13,128 INFO ]: Without dead ends: 9 [2018-06-25 06:58:13,128 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:58:13,128 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:13,129 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-25 06:58:13,129 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:58:13,129 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-06-25 06:58:13,129 INFO ]: Start accepts. Automaton has 8 states and 19 transitions. Word has length 6 [2018-06-25 06:58:13,129 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:13,129 INFO ]: Abstraction has 8 states and 19 transitions. [2018-06-25 06:58:13,129 INFO ]: Interpolant automaton has 4 states. [2018-06-25 06:58:13,129 INFO ]: Start isEmpty. Operand 8 states and 19 transitions. [2018-06-25 06:58:13,129 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:58:13,129 INFO ]: Found error trace [2018-06-25 06:58:13,129 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:58:13,129 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:13,130 INFO ]: Analyzing trace with hash -13154757, now seen corresponding path program 2 times [2018-06-25 06:58:13,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:13,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:13,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:13,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:13,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:13,144 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:13,248 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:58:13,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:13,248 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-25 06:58:13,254 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 06:58:13,305 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 06:58:13,305 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:13,307 INFO ]: Computing forward predicates... [2018-06-25 06:58:13,376 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:58:13,411 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:13,412 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 06:58:13,412 INFO ]: Interpolant automaton has 7 states [2018-06-25 06:58:13,412 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 06:58:13,412 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:58:13,412 INFO ]: Start difference. First operand 8 states and 19 transitions. Second operand 7 states. [2018-06-25 06:58:13,856 WARN ]: Spent 224.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-06-25 06:58:14,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:14,200 INFO ]: Finished difference Result 11 states and 21 transitions. [2018-06-25 06:58:14,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:58:14,200 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 06:58:14,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:14,200 INFO ]: With dead ends: 11 [2018-06-25 06:58:14,200 INFO ]: Without dead ends: 9 [2018-06-25 06:58:14,200 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:58:14,200 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:14,201 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-25 06:58:14,201 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:58:14,201 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-06-25 06:58:14,201 INFO ]: Start accepts. Automaton has 8 states and 17 transitions. Word has length 7 [2018-06-25 06:58:14,201 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:14,201 INFO ]: Abstraction has 8 states and 17 transitions. [2018-06-25 06:58:14,201 INFO ]: Interpolant automaton has 7 states. [2018-06-25 06:58:14,201 INFO ]: Start isEmpty. Operand 8 states and 17 transitions. [2018-06-25 06:58:14,201 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:58:14,201 INFO ]: Found error trace [2018-06-25 06:58:14,201 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:58:14,201 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:14,202 INFO ]: Analyzing trace with hash -1269269525, now seen corresponding path program 1 times [2018-06-25 06:58:14,202 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:14,202 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:14,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:14,202 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 06:58:14,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:14,220 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:14,860 WARN ]: Spent 446.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-06-25 06:58:15,034 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:58:15,035 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:15,035 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) [2018-06-25 06:58:15,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:58:15,102 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:15,105 INFO ]: Computing forward predicates... [2018-06-25 06:58:15,628 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:58:15,648 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:15,648 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 06:58:15,649 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:58:15,649 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:58:15,649 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:58:15,649 INFO ]: Start difference. First operand 8 states and 17 transitions. Second operand 6 states. [2018-06-25 06:58:16,033 WARN ]: Spent 199.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-06-25 06:58:16,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:16,055 INFO ]: Finished difference Result 10 states and 22 transitions. [2018-06-25 06:58:16,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:58:16,055 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 06:58:16,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:16,055 INFO ]: With dead ends: 10 [2018-06-25 06:58:16,055 INFO ]: Without dead ends: 10 [2018-06-25 06:58:16,056 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:58:16,056 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 06:58:16,057 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-25 06:58:16,057 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:58:16,057 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-06-25 06:58:16,057 INFO ]: Start accepts. Automaton has 9 states and 21 transitions. Word has length 7 [2018-06-25 06:58:16,057 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:16,057 INFO ]: Abstraction has 9 states and 21 transitions. [2018-06-25 06:58:16,057 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:58:16,057 INFO ]: Start isEmpty. Operand 9 states and 21 transitions. [2018-06-25 06:58:16,057 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:58:16,057 INFO ]: Found error trace [2018-06-25 06:58:16,057 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:58:16,058 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:16,058 INFO ]: Analyzing trace with hash -1269266642, now seen corresponding path program 1 times [2018-06-25 06:58:16,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:16,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:16,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:16,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:16,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:16,081 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:16,179 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:58:16,179 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:16,179 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:58:16,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:16,229 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:16,232 INFO ]: Computing forward predicates... [2018-06-25 06:58:16,365 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:58:16,367 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:58:16,485 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:58:16,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:16,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 06:58:16,506 INFO ]: Interpolant automaton has 7 states [2018-06-25 06:58:16,506 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 06:58:16,506 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:58:16,506 INFO ]: Start difference. First operand 9 states and 21 transitions. Second operand 7 states. [2018-06-25 06:58:16,755 WARN ]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 06:58:17,427 WARN ]: Spent 299.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2018-06-25 06:58:17,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:17,438 INFO ]: Finished difference Result 7 states and 12 transitions. [2018-06-25 06:58:17,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:58:17,438 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 06:58:17,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:17,438 INFO ]: With dead ends: 7 [2018-06-25 06:58:17,438 INFO ]: Without dead ends: 0 [2018-06-25 06:58:17,439 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-25 06:58:17,439 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 06:58:17,439 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 06:58:17,439 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 06:58:17,439 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 06:58:17,439 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 06:58:17,439 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:17,439 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 06:58:17,439 INFO ]: Interpolant automaton has 7 states. [2018-06-25 06:58:17,439 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 06:58:17,439 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 06:58:17,441 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 06:58:17,442 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:58:17 BasicIcfg [2018-06-25 06:58:17,442 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 06:58:17,444 INFO ]: Toolchain (without parser) took 42827.82 ms. Allocated memory was 307.2 MB in the beginning and 1.2 GB in the end (delta: 926.9 MB). Free memory was 259.5 MB in the beginning and 258.8 MB in the end (delta: 727.8 kB). Peak memory consumption was 927.7 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:17,445 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:58:17,445 INFO ]: ChcToBoogie took 64.52 ms. Allocated memory is still 307.2 MB. Free memory was 259.5 MB in the beginning and 256.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:17,446 INFO ]: Boogie Preprocessor took 44.16 ms. Allocated memory is still 307.2 MB. Free memory was 256.5 MB in the beginning and 255.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:17,446 INFO ]: RCFGBuilder took 294.54 ms. Allocated memory is still 307.2 MB. Free memory was 255.5 MB in the beginning and 241.5 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:58:17,447 INFO ]: BlockEncodingV2 took 15534.20 ms. Allocated memory was 307.2 MB in the beginning and 726.7 MB in the end (delta: 419.4 MB). Free memory was 241.5 MB in the beginning and 372.7 MB in the end (delta: -131.3 MB). Peak memory consumption was 404.4 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:17,447 INFO ]: TraceAbstraction took 26875.71 ms. Allocated memory was 726.7 MB in the beginning and 1.2 GB in the end (delta: 507.5 MB). Free memory was 372.7 MB in the beginning and 258.8 MB in the end (delta: 113.9 MB). Peak memory consumption was 621.5 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:17,453 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.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.52 ms. Allocated memory is still 307.2 MB. Free memory was 259.5 MB in the beginning and 256.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.16 ms. Allocated memory is still 307.2 MB. Free memory was 256.5 MB in the beginning and 255.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 294.54 ms. Allocated memory is still 307.2 MB. Free memory was 255.5 MB in the beginning and 241.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 15534.20 ms. Allocated memory was 307.2 MB in the beginning and 726.7 MB in the end (delta: 419.4 MB). Free memory was 241.5 MB in the beginning and 372.7 MB in the end (delta: -131.3 MB). Peak memory consumption was 404.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 26875.71 ms. Allocated memory was 726.7 MB in the beginning and 1.2 GB in the end (delta: 507.5 MB). Free memory was 372.7 MB in the beginning and 258.8 MB in the end (delta: 113.9 MB). Peak memory consumption was 621.5 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, 26.8s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 21.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16315 SDtfs, 6 SDslu, 104 SDs, 0 SdLazy, 8250 SolverSat, 8252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=22, 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, 23 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 2017 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1200 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 28 InterpolantComputations, 18 PerfectInterpolantSequences, 13/35 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_e8_517.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_06-58-17-477.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e8_517.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_06-58-17-477.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e8_517.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_06-58-17-477.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e8_517.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_06-58-17-477.csv Received shutdown request...