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/ex8_e8_220_e7_249.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 03:46:43,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 03:46:44,001 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 03:46:44,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 03:46:44,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 03:46:44,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 03:46:44,019 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 03:46:44,021 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 03:46:44,022 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 03:46:44,023 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 03:46:44,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 03:46:44,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 03:46:44,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 03:46:44,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 03:46:44,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 03:46:44,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 03:46:44,031 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 03:46:44,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 03:46:44,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 03:46:44,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 03:46:44,048 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 03:46:44,050 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 03:46:44,050 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 03:46:44,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 03:46:44,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 03:46:44,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 03:46:44,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 03:46:44,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 03:46:44,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 03:46:44,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 03:46:44,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 03:46:44,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 03:46:44,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 03:46:44,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 03:46:44,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 03:46:44,059 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 03:46:44,078 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 03:46:44,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 03:46:44,079 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 03:46:44,079 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 03:46:44,080 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 03:46:44,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 03:46:44,080 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 03:46:44,081 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 03:46:44,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 03:46:44,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 03:46:44,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 03:46:44,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 03:46:44,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:46:44,082 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 03:46:44,082 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 03:46:44,082 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 03:46:44,082 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 03:46:44,082 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 03:46:44,083 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 03:46:44,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 03:46:44,083 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 03:46:44,085 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 03:46:44,085 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 03:46:44,133 INFO ]: Repository-Root is: /tmp [2018-06-25 03:46:44,146 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 03:46:44,150 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 03:46:44,152 INFO ]: Initializing SmtParser... [2018-06-25 03:46:44,152 INFO ]: SmtParser initialized [2018-06-25 03:46:44,153 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e8_220_e7_249.smt2 [2018-06-25 03:46:44,154 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 03:46:44,242 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e8_220_e7_249.smt2 unknown [2018-06-25 03:46:44,507 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e8_220_e7_249.smt2 [2018-06-25 03:46:44,511 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 03:46:44,525 INFO ]: Walking toolchain with 5 elements. [2018-06-25 03:46:44,526 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 03:46:44,526 INFO ]: Initializing ChcToBoogie... [2018-06-25 03:46:44,526 INFO ]: ChcToBoogie initialized [2018-06-25 03:46:44,529 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:46:44" (1/1) ... [2018-06-25 03:46:44,590 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:44 Unit [2018-06-25 03:46:44,591 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 03:46:44,591 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 03:46:44,591 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 03:46:44,591 INFO ]: Boogie Preprocessor initialized [2018-06-25 03:46:44,612 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:44" (1/1) ... [2018-06-25 03:46:44,612 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:44" (1/1) ... [2018-06-25 03:46:44,619 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:44" (1/1) ... [2018-06-25 03:46:44,619 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:44" (1/1) ... [2018-06-25 03:46:44,631 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:44" (1/1) ... [2018-06-25 03:46:44,632 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:44" (1/1) ... [2018-06-25 03:46:44,633 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:44" (1/1) ... [2018-06-25 03:46:44,642 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 03:46:44,643 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 03:46:44,643 INFO ]: Initializing RCFGBuilder... [2018-06-25 03:46:44,643 INFO ]: RCFGBuilder initialized [2018-06-25 03:46:44,644 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:44" (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 03:46:44,664 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 03:46:44,664 INFO ]: Found specification of procedure gotoProc [2018-06-25 03:46:44,664 INFO ]: Found implementation of procedure gotoProc [2018-06-25 03:46:44,664 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 03:46:44,664 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 03:46:44,664 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 03:46:44,989 INFO ]: Using library mode [2018-06-25 03:46:44,990 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:46:44 BoogieIcfgContainer [2018-06-25 03:46:44,990 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 03:46:44,990 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 03:46:44,990 INFO ]: Initializing BlockEncodingV2... [2018-06-25 03:46:44,994 INFO ]: BlockEncodingV2 initialized [2018-06-25 03:46:44,995 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:46:44" (1/1) ... [2018-06-25 03:46:45,012 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 03:46:45,013 INFO ]: Using Remove infeasible edges [2018-06-25 03:46:45,014 INFO ]: Using Maximize final states [2018-06-25 03:46:45,015 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 03:46:45,015 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 03:46:45,017 INFO ]: Using Remove sink states [2018-06-25 03:46:45,018 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 03:46:45,020 INFO ]: Using Use SBE [2018-06-25 03:46:45,025 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 03:46:47,032 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:46:47,033 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 03:46:47,491 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:46:47,492 INFO ]: SBE split 2 edges [2018-06-25 03:46:47,506 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 03:46:47,513 INFO ]: 0 new accepting states [2018-06-25 03:46:59,798 INFO ]: Removed 2058 edges and 2 locations by large block encoding [2018-06-25 03:46:59,801 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:59,814 INFO ]: Removed 5 edges and 0 locations because of local infeasibility [2018-06-25 03:46:59,815 INFO ]: 0 new accepting states [2018-06-25 03:46:59,817 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:46:59,818 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:59,824 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 03:46:59,826 INFO ]: 0 new accepting states [2018-06-25 03:46:59,828 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:46:59,829 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:59,837 INFO ]: Encoded RCFG 6 locations, 2055 edges [2018-06-25 03:46:59,838 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:46:59 BasicIcfg [2018-06-25 03:46:59,838 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 03:46:59,840 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 03:46:59,840 INFO ]: Initializing TraceAbstraction... [2018-06-25 03:46:59,843 INFO ]: TraceAbstraction initialized [2018-06-25 03:46:59,843 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:46:44" (1/4) ... [2018-06-25 03:46:59,844 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512256f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 03:46:59, skipping insertion in model container [2018-06-25 03:46:59,844 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:44" (2/4) ... [2018-06-25 03:46:59,844 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512256f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 03:46:59, skipping insertion in model container [2018-06-25 03:46:59,844 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:46:44" (3/4) ... [2018-06-25 03:46:59,844 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512256f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:46:59, skipping insertion in model container [2018-06-25 03:46:59,844 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:46:59" (4/4) ... [2018-06-25 03:46:59,846 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 03:46:59,854 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 03:46:59,862 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 03:46:59,908 INFO ]: Using default assertion order modulation [2018-06-25 03:46:59,908 INFO ]: Interprodecural is true [2018-06-25 03:46:59,908 INFO ]: Hoare is false [2018-06-25 03:46:59,908 INFO ]: Compute interpolants for FPandBP [2018-06-25 03:46:59,908 INFO ]: Backedges is TWOTRACK [2018-06-25 03:46:59,908 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 03:46:59,908 INFO ]: Difference is false [2018-06-25 03:46:59,908 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 03:46:59,908 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 03:46:59,933 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 03:46:59,950 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:46:59,950 INFO ]: Found error trace [2018-06-25 03:46:59,951 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:46:59,951 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:59,956 INFO ]: Analyzing trace with hash 161073493, now seen corresponding path program 1 times [2018-06-25 03:46:59,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:59,959 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:59,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:59,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:59,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:00,036 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:00,088 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:00,090 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:00,090 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:00,091 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:00,101 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:00,101 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:00,104 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 03:47:03,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:03,414 INFO ]: Finished difference Result 7 states and 2056 transitions. [2018-06-25 03:47:03,414 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:03,415 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:47:03,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:03,428 INFO ]: With dead ends: 7 [2018-06-25 03:47:03,428 INFO ]: Without dead ends: 7 [2018-06-25 03:47:03,430 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 03:47:03,447 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:03,500 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:03,501 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:03,505 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2056 transitions. [2018-06-25 03:47:03,506 INFO ]: Start accepts. Automaton has 7 states and 2056 transitions. Word has length 5 [2018-06-25 03:47:03,507 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:03,507 INFO ]: Abstraction has 7 states and 2056 transitions. [2018-06-25 03:47:03,507 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:03,507 INFO ]: Start isEmpty. Operand 7 states and 2056 transitions. [2018-06-25 03:47:03,508 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:03,508 INFO ]: Found error trace [2018-06-25 03:47:03,508 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:03,509 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:03,509 INFO ]: Analyzing trace with hash 579668008, now seen corresponding path program 1 times [2018-06-25 03:47:03,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:03,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:03,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:03,510 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:03,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:03,541 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:03,611 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:03,611 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:03,611 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:03,612 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:03,613 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:03,613 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:03,613 INFO ]: Start difference. First operand 7 states and 2056 transitions. Second operand 3 states. [2018-06-25 03:47:06,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:06,568 INFO ]: Finished difference Result 8 states and 2056 transitions. [2018-06-25 03:47:06,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:06,569 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:06,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:06,571 INFO ]: With dead ends: 8 [2018-06-25 03:47:06,571 INFO ]: Without dead ends: 7 [2018-06-25 03:47:06,571 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 03:47:06,571 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:06,580 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:06,581 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:06,587 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1544 transitions. [2018-06-25 03:47:06,587 INFO ]: Start accepts. Automaton has 7 states and 1544 transitions. Word has length 6 [2018-06-25 03:47:06,587 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:06,587 INFO ]: Abstraction has 7 states and 1544 transitions. [2018-06-25 03:47:06,587 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:06,587 INFO ]: Start isEmpty. Operand 7 states and 1544 transitions. [2018-06-25 03:47:06,588 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:06,588 INFO ]: Found error trace [2018-06-25 03:47:06,588 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:06,588 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:06,588 INFO ]: Analyzing trace with hash 581515050, now seen corresponding path program 1 times [2018-06-25 03:47:06,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:06,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:06,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:06,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:06,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:06,615 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:06,673 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:06,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:06,673 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:06,673 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:06,673 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:06,673 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:06,674 INFO ]: Start difference. First operand 7 states and 1544 transitions. Second operand 3 states. [2018-06-25 03:47:08,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:08,648 INFO ]: Finished difference Result 8 states and 1544 transitions. [2018-06-25 03:47:08,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:08,649 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:08,649 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:08,651 INFO ]: With dead ends: 8 [2018-06-25 03:47:08,651 INFO ]: Without dead ends: 7 [2018-06-25 03:47:08,651 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 03:47:08,651 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:08,658 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:08,658 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:08,660 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1160 transitions. [2018-06-25 03:47:08,660 INFO ]: Start accepts. Automaton has 7 states and 1160 transitions. Word has length 6 [2018-06-25 03:47:08,660 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:08,660 INFO ]: Abstraction has 7 states and 1160 transitions. [2018-06-25 03:47:08,660 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:08,661 INFO ]: Start isEmpty. Operand 7 states and 1160 transitions. [2018-06-25 03:47:08,661 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:08,661 INFO ]: Found error trace [2018-06-25 03:47:08,661 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:08,661 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:08,661 INFO ]: Analyzing trace with hash 582438571, now seen corresponding path program 1 times [2018-06-25 03:47:08,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:08,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:08,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:08,665 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:08,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:08,705 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:08,836 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:08,836 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:08,836 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:08,836 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:08,836 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:08,836 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:08,836 INFO ]: Start difference. First operand 7 states and 1160 transitions. Second operand 3 states. [2018-06-25 03:47:09,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:09,973 INFO ]: Finished difference Result 8 states and 1160 transitions. [2018-06-25 03:47:09,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:09,974 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:09,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:09,975 INFO ]: With dead ends: 8 [2018-06-25 03:47:09,975 INFO ]: Without dead ends: 7 [2018-06-25 03:47:09,975 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 03:47:09,975 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:09,982 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:09,982 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:09,983 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 776 transitions. [2018-06-25 03:47:09,984 INFO ]: Start accepts. Automaton has 7 states and 776 transitions. Word has length 6 [2018-06-25 03:47:09,984 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:09,984 INFO ]: Abstraction has 7 states and 776 transitions. [2018-06-25 03:47:09,984 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:09,984 INFO ]: Start isEmpty. Operand 7 states and 776 transitions. [2018-06-25 03:47:09,985 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:09,985 INFO ]: Found error trace [2018-06-25 03:47:09,985 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:09,985 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:09,985 INFO ]: Analyzing trace with hash -364170454, now seen corresponding path program 1 times [2018-06-25 03:47:09,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:09,985 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:09,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:09,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:09,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:10,019 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:10,051 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:10,051 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:10,051 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:10,051 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:10,051 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:10,051 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:10,051 INFO ]: Start difference. First operand 7 states and 776 transitions. Second operand 3 states. [2018-06-25 03:47:10,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:10,660 INFO ]: Finished difference Result 8 states and 776 transitions. [2018-06-25 03:47:10,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:10,660 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:10,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:10,661 INFO ]: With dead ends: 8 [2018-06-25 03:47:10,661 INFO ]: Without dead ends: 7 [2018-06-25 03:47:10,661 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 03:47:10,661 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:10,665 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:10,665 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:10,666 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 584 transitions. [2018-06-25 03:47:10,666 INFO ]: Start accepts. Automaton has 7 states and 584 transitions. Word has length 6 [2018-06-25 03:47:10,666 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:10,666 INFO ]: Abstraction has 7 states and 584 transitions. [2018-06-25 03:47:10,666 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:10,666 INFO ]: Start isEmpty. Operand 7 states and 584 transitions. [2018-06-25 03:47:10,666 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:10,666 INFO ]: Found error trace [2018-06-25 03:47:10,666 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:10,666 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:10,667 INFO ]: Analyzing trace with hash -363246933, now seen corresponding path program 1 times [2018-06-25 03:47:10,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:10,667 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:10,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:10,667 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:10,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:10,691 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:10,755 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:10,755 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:10,755 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:10,755 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:10,755 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:10,755 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:10,755 INFO ]: Start difference. First operand 7 states and 584 transitions. Second operand 3 states. [2018-06-25 03:47:11,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:11,273 INFO ]: Finished difference Result 8 states and 584 transitions. [2018-06-25 03:47:11,274 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:11,274 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:11,274 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:11,274 INFO ]: With dead ends: 8 [2018-06-25 03:47:11,274 INFO ]: Without dead ends: 7 [2018-06-25 03:47:11,275 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 03:47:11,275 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:11,278 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:11,278 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:11,279 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 488 transitions. [2018-06-25 03:47:11,279 INFO ]: Start accepts. Automaton has 7 states and 488 transitions. Word has length 6 [2018-06-25 03:47:11,279 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:11,279 INFO ]: Abstraction has 7 states and 488 transitions. [2018-06-25 03:47:11,279 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:11,279 INFO ]: Start isEmpty. Operand 7 states and 488 transitions. [2018-06-25 03:47:11,280 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:11,280 INFO ]: Found error trace [2018-06-25 03:47:11,280 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:11,280 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:11,280 INFO ]: Analyzing trace with hash -359552849, now seen corresponding path program 1 times [2018-06-25 03:47:11,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:11,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:11,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:11,281 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:11,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:11,296 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:11,392 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:11,392 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:11,392 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:11,392 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:11,393 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:11,393 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:11,393 INFO ]: Start difference. First operand 7 states and 488 transitions. Second operand 3 states. [2018-06-25 03:47:12,357 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:12,357 INFO ]: Finished difference Result 8 states and 488 transitions. [2018-06-25 03:47:12,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:12,359 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:12,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:12,360 INFO ]: With dead ends: 8 [2018-06-25 03:47:12,360 INFO ]: Without dead ends: 7 [2018-06-25 03:47:12,360 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 03:47:12,360 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:12,362 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:12,362 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:12,363 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 296 transitions. [2018-06-25 03:47:12,363 INFO ]: Start accepts. Automaton has 7 states and 296 transitions. Word has length 6 [2018-06-25 03:47:12,363 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:12,363 INFO ]: Abstraction has 7 states and 296 transitions. [2018-06-25 03:47:12,363 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:12,363 INFO ]: Start isEmpty. Operand 7 states and 296 transitions. [2018-06-25 03:47:12,364 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:12,364 INFO ]: Found error trace [2018-06-25 03:47:12,364 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:12,364 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:12,364 INFO ]: Analyzing trace with hash -836089685, now seen corresponding path program 1 times [2018-06-25 03:47:12,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:12,364 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:12,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:12,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:12,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:12,378 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:12,489 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:12,490 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:12,490 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:12,490 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:12,490 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:12,490 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:12,490 INFO ]: Start difference. First operand 7 states and 296 transitions. Second operand 3 states. [2018-06-25 03:47:12,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:12,727 INFO ]: Finished difference Result 8 states and 296 transitions. [2018-06-25 03:47:12,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:12,727 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:12,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:12,728 INFO ]: With dead ends: 8 [2018-06-25 03:47:12,728 INFO ]: Without dead ends: 7 [2018-06-25 03:47:12,728 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 03:47:12,728 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:12,730 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:12,730 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:12,730 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2018-06-25 03:47:12,730 INFO ]: Start accepts. Automaton has 7 states and 200 transitions. Word has length 6 [2018-06-25 03:47:12,730 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:12,730 INFO ]: Abstraction has 7 states and 200 transitions. [2018-06-25 03:47:12,730 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:12,730 INFO ]: Start isEmpty. Operand 7 states and 200 transitions. [2018-06-25 03:47:12,731 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:12,731 INFO ]: Found error trace [2018-06-25 03:47:12,731 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:12,731 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:12,731 INFO ]: Analyzing trace with hash -1074358103, now seen corresponding path program 1 times [2018-06-25 03:47:12,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:12,731 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:12,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:12,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:12,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:12,741 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:12,854 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:12,854 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:12,854 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:12,854 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:12,854 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:12,854 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:12,854 INFO ]: Start difference. First operand 7 states and 200 transitions. Second operand 3 states. [2018-06-25 03:47:13,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:13,503 INFO ]: Finished difference Result 8 states and 200 transitions. [2018-06-25 03:47:13,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:13,504 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:13,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:13,504 INFO ]: With dead ends: 8 [2018-06-25 03:47:13,504 INFO ]: Without dead ends: 7 [2018-06-25 03:47:13,504 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 03:47:13,505 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:13,505 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:13,505 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:13,506 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2018-06-25 03:47:13,506 INFO ]: Start accepts. Automaton has 7 states and 152 transitions. Word has length 6 [2018-06-25 03:47:13,506 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:13,506 INFO ]: Abstraction has 7 states and 152 transitions. [2018-06-25 03:47:13,506 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:13,506 INFO ]: Start isEmpty. Operand 7 states and 152 transitions. [2018-06-25 03:47:13,506 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:13,506 INFO ]: Found error trace [2018-06-25 03:47:13,506 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:13,507 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:13,507 INFO ]: Analyzing trace with hash -128672599, now seen corresponding path program 1 times [2018-06-25 03:47:13,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:13,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:13,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:13,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:13,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:13,518 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:13,538 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:13,538 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:13,538 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:13,538 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:13,538 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:13,538 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:13,538 INFO ]: Start difference. First operand 7 states and 152 transitions. Second operand 3 states. [2018-06-25 03:47:13,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:13,657 INFO ]: Finished difference Result 8 states and 152 transitions. [2018-06-25 03:47:13,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:13,658 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:13,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:13,658 INFO ]: With dead ends: 8 [2018-06-25 03:47:13,658 INFO ]: Without dead ends: 7 [2018-06-25 03:47:13,658 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 03:47:13,658 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:13,659 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:13,659 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:13,660 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2018-06-25 03:47:13,660 INFO ]: Start accepts. Automaton has 7 states and 104 transitions. Word has length 6 [2018-06-25 03:47:13,660 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:13,660 INFO ]: Abstraction has 7 states and 104 transitions. [2018-06-25 03:47:13,660 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:13,660 INFO ]: Start isEmpty. Operand 7 states and 104 transitions. [2018-06-25 03:47:13,660 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:13,660 INFO ]: Found error trace [2018-06-25 03:47:13,660 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:13,660 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:13,660 INFO ]: Analyzing trace with hash 109595819, now seen corresponding path program 1 times [2018-06-25 03:47:13,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:13,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:13,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:13,661 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:13,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:13,672 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:13,965 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 03:47:13,966 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:13,966 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:47:13,966 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 03:47:13,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:14,048 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:14,058 INFO ]: Computing forward predicates... [2018-06-25 03:47:14,371 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:14,394 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:47:14,394 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 03:47:14,394 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:47:14,394 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:47:14,394 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:47:14,394 INFO ]: Start difference. First operand 7 states and 104 transitions. Second operand 6 states. [2018-06-25 03:47:15,103 WARN ]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 03:47:16,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:16,052 INFO ]: Finished difference Result 17 states and 111 transitions. [2018-06-25 03:47:16,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 03:47:16,052 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 03:47:16,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:16,054 INFO ]: With dead ends: 17 [2018-06-25 03:47:16,054 INFO ]: Without dead ends: 13 [2018-06-25 03:47:16,054 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-06-25 03:47:16,054 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 03:47:16,057 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-25 03:47:16,057 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 03:47:16,058 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2018-06-25 03:47:16,058 INFO ]: Start accepts. Automaton has 9 states and 75 transitions. Word has length 6 [2018-06-25 03:47:16,058 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:16,058 INFO ]: Abstraction has 9 states and 75 transitions. [2018-06-25 03:47:16,058 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:47:16,058 INFO ]: Start isEmpty. Operand 9 states and 75 transitions. [2018-06-25 03:47:16,058 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:16,058 INFO ]: Found error trace [2018-06-25 03:47:16,058 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:16,058 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:16,058 INFO ]: Analyzing trace with hash -831469197, now seen corresponding path program 1 times [2018-06-25 03:47:16,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:16,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:16,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:16,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:16,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:16,086 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:16,146 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:16,146 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:16,146 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:16,146 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:16,146 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:16,146 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:16,146 INFO ]: Start difference. First operand 9 states and 75 transitions. Second operand 3 states. [2018-06-25 03:47:16,526 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:16,526 INFO ]: Finished difference Result 11 states and 75 transitions. [2018-06-25 03:47:16,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:16,526 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:16,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:16,527 INFO ]: With dead ends: 11 [2018-06-25 03:47:16,527 INFO ]: Without dead ends: 9 [2018-06-25 03:47:16,527 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 03:47:16,527 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:47:16,528 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 03:47:16,528 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 03:47:16,528 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2018-06-25 03:47:16,528 INFO ]: Start accepts. Automaton has 9 states and 59 transitions. Word has length 6 [2018-06-25 03:47:16,528 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:16,529 INFO ]: Abstraction has 9 states and 59 transitions. [2018-06-25 03:47:16,529 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:16,529 INFO ]: Start isEmpty. Operand 9 states and 59 transitions. [2018-06-25 03:47:16,529 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:16,529 INFO ]: Found error trace [2018-06-25 03:47:16,529 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:16,529 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:16,529 INFO ]: Analyzing trace with hash -1132537043, now seen corresponding path program 1 times [2018-06-25 03:47:16,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:16,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:16,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:16,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:16,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:16,545 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:16,653 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:16,653 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:16,653 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:16,654 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:16,654 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:16,654 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:16,654 INFO ]: Start difference. First operand 9 states and 59 transitions. Second operand 3 states. [2018-06-25 03:47:16,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:16,863 INFO ]: Finished difference Result 11 states and 59 transitions. [2018-06-25 03:47:16,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:16,863 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:16,863 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:16,863 INFO ]: With dead ends: 11 [2018-06-25 03:47:16,863 INFO ]: Without dead ends: 9 [2018-06-25 03:47:16,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 03:47:16,864 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:47:16,865 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 03:47:16,865 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 03:47:16,865 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2018-06-25 03:47:16,865 INFO ]: Start accepts. Automaton has 9 states and 47 transitions. Word has length 6 [2018-06-25 03:47:16,865 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:16,865 INFO ]: Abstraction has 9 states and 47 transitions. [2018-06-25 03:47:16,865 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:16,865 INFO ]: Start isEmpty. Operand 9 states and 47 transitions. [2018-06-25 03:47:16,865 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:16,865 INFO ]: Found error trace [2018-06-25 03:47:16,865 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:16,865 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:16,865 INFO ]: Analyzing trace with hash -1130692884, now seen corresponding path program 1 times [2018-06-25 03:47:16,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:16,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:16,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:16,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:16,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:16,873 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:16,981 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:16,981 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:16,981 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:16,982 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:16,982 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:16,982 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:16,982 INFO ]: Start difference. First operand 9 states and 47 transitions. Second operand 3 states. [2018-06-25 03:47:17,469 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:17,469 INFO ]: Finished difference Result 10 states and 47 transitions. [2018-06-25 03:47:17,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:17,471 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:17,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:17,471 INFO ]: With dead ends: 10 [2018-06-25 03:47:17,471 INFO ]: Without dead ends: 9 [2018-06-25 03:47:17,472 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 03:47:17,472 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:47:17,472 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 03:47:17,473 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 03:47:17,473 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2018-06-25 03:47:17,473 INFO ]: Start accepts. Automaton has 9 states and 39 transitions. Word has length 6 [2018-06-25 03:47:17,473 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:17,473 INFO ]: Abstraction has 9 states and 39 transitions. [2018-06-25 03:47:17,473 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:17,473 INFO ]: Start isEmpty. Operand 9 states and 39 transitions. [2018-06-25 03:47:17,473 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:17,473 INFO ]: Found error trace [2018-06-25 03:47:17,473 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:17,473 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:17,473 INFO ]: Analyzing trace with hash -302294547, now seen corresponding path program 1 times [2018-06-25 03:47:17,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:17,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:17,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:17,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:17,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:17,482 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:17,592 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:17,592 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:17,592 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:17,593 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:17,593 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:17,593 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:17,593 INFO ]: Start difference. First operand 9 states and 39 transitions. Second operand 3 states. [2018-06-25 03:47:17,792 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:17,792 INFO ]: Finished difference Result 11 states and 39 transitions. [2018-06-25 03:47:17,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:17,792 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:17,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:17,792 INFO ]: With dead ends: 11 [2018-06-25 03:47:17,792 INFO ]: Without dead ends: 9 [2018-06-25 03:47:17,793 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 03:47:17,793 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:47:17,794 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 03:47:17,794 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 03:47:17,794 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-06-25 03:47:17,794 INFO ]: Start accepts. Automaton has 9 states and 27 transitions. Word has length 6 [2018-06-25 03:47:17,794 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:17,794 INFO ]: Abstraction has 9 states and 27 transitions. [2018-06-25 03:47:17,794 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:17,794 INFO ]: Start isEmpty. Operand 9 states and 27 transitions. [2018-06-25 03:47:17,794 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:17,794 INFO ]: Found error trace [2018-06-25 03:47:17,794 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:17,794 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:17,794 INFO ]: Analyzing trace with hash 20017165, now seen corresponding path program 1 times [2018-06-25 03:47:17,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:17,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:17,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:17,795 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:17,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:17,805 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:17,893 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:17,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:47:17,893 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 03:47:17,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:17,948 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:17,950 INFO ]: Computing forward predicates... [2018-06-25 03:47:18,159 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:18,178 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:47:18,178 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 03:47:18,178 INFO ]: Interpolant automaton has 5 states [2018-06-25 03:47:18,179 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 03:47:18,179 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:47:18,179 INFO ]: Start difference. First operand 9 states and 27 transitions. Second operand 5 states. [2018-06-25 03:47:18,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:18,258 INFO ]: Finished difference Result 12 states and 29 transitions. [2018-06-25 03:47:18,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:47:18,258 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 03:47:18,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:18,259 INFO ]: With dead ends: 12 [2018-06-25 03:47:18,259 INFO ]: Without dead ends: 12 [2018-06-25 03:47:18,259 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:47:18,259 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 03:47:18,260 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-25 03:47:18,260 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:47:18,261 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-25 03:47:18,261 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 6 [2018-06-25 03:47:18,261 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:18,261 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-25 03:47:18,261 INFO ]: Interpolant automaton has 5 states. [2018-06-25 03:47:18,261 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-25 03:47:18,261 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:18,261 INFO ]: Found error trace [2018-06-25 03:47:18,261 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:18,261 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:18,261 INFO ]: Analyzing trace with hash -1101140212, now seen corresponding path program 1 times [2018-06-25 03:47:18,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:18,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:18,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:18,262 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:18,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:18,271 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:18,320 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:18,320 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:47:18,320 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 03:47:18,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:18,358 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:18,360 INFO ]: Computing forward predicates... [2018-06-25 03:47:18,475 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:18,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:47:18,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 03:47:18,506 INFO ]: Interpolant automaton has 5 states [2018-06-25 03:47:18,506 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 03:47:18,506 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:47:18,506 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 5 states. [2018-06-25 03:47:18,759 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:18,759 INFO ]: Finished difference Result 14 states and 31 transitions. [2018-06-25 03:47:18,782 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:47:18,782 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 03:47:18,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:18,783 INFO ]: With dead ends: 14 [2018-06-25 03:47:18,783 INFO ]: Without dead ends: 10 [2018-06-25 03:47:18,783 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:47:18,783 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 03:47:18,784 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 03:47:18,784 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:47:18,784 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-06-25 03:47:18,784 INFO ]: Start accepts. Automaton has 8 states and 21 transitions. Word has length 6 [2018-06-25 03:47:18,784 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:18,784 INFO ]: Abstraction has 8 states and 21 transitions. [2018-06-25 03:47:18,784 INFO ]: Interpolant automaton has 5 states. [2018-06-25 03:47:18,784 INFO ]: Start isEmpty. Operand 8 states and 21 transitions. [2018-06-25 03:47:18,784 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:18,785 INFO ]: Found error trace [2018-06-25 03:47:18,785 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:18,785 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:18,785 INFO ]: Analyzing trace with hash 331240859, now seen corresponding path program 1 times [2018-06-25 03:47:18,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:18,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:18,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:18,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:18,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:18,794 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:18,898 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:18,898 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:47:18,898 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:47:18,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:18,926 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:18,927 INFO ]: Computing forward predicates... [2018-06-25 03:47:19,016 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:19,035 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:47:19,035 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 03:47:19,035 INFO ]: Interpolant automaton has 5 states [2018-06-25 03:47:19,035 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 03:47:19,035 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:47:19,035 INFO ]: Start difference. First operand 8 states and 21 transitions. Second operand 5 states. [2018-06-25 03:47:19,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:19,126 INFO ]: Finished difference Result 13 states and 27 transitions. [2018-06-25 03:47:19,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:47:19,126 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 03:47:19,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:19,126 INFO ]: With dead ends: 13 [2018-06-25 03:47:19,126 INFO ]: Without dead ends: 13 [2018-06-25 03:47:19,126 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:47:19,127 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 03:47:19,127 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-25 03:47:19,127 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 03:47:19,128 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-06-25 03:47:19,128 INFO ]: Start accepts. Automaton has 11 states and 25 transitions. Word has length 6 [2018-06-25 03:47:19,128 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:19,128 INFO ]: Abstraction has 11 states and 25 transitions. [2018-06-25 03:47:19,128 INFO ]: Interpolant automaton has 5 states. [2018-06-25 03:47:19,128 INFO ]: Start isEmpty. Operand 11 states and 25 transitions. [2018-06-25 03:47:19,128 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:19,128 INFO ]: Found error trace [2018-06-25 03:47:19,128 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:19,128 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:19,128 INFO ]: Analyzing trace with hash -731731812, now seen corresponding path program 1 times [2018-06-25 03:47:19,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:19,128 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:19,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:19,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:19,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:19,145 INFO ]: Conjunction of SSA is sat [2018-06-25 03:47:19,147 INFO ]: Counterexample might be feasible [2018-06-25 03:47:19,167 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 03:47:19,179 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:47:19 BasicIcfg [2018-06-25 03:47:19,179 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 03:47:19,180 INFO ]: Toolchain (without parser) took 34668.16 ms. Allocated memory was 306.7 MB in the beginning and 1.0 GB in the end (delta: 724.6 MB). Free memory was 259.0 MB in the beginning and 227.7 MB in the end (delta: 31.3 MB). Peak memory consumption was 755.9 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:19,180 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:47:19,181 INFO ]: ChcToBoogie took 64.88 ms. Allocated memory is still 306.7 MB. Free memory was 259.0 MB in the beginning and 256.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:19,181 INFO ]: Boogie Preprocessor took 51.23 ms. Allocated memory is still 306.7 MB. Free memory was 256.0 MB in the beginning and 255.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:19,181 INFO ]: RCFGBuilder took 346.90 ms. Allocated memory is still 306.7 MB. Free memory was 255.0 MB in the beginning and 241.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:19,182 INFO ]: BlockEncodingV2 took 14847.64 ms. Allocated memory was 306.7 MB in the beginning and 736.1 MB in the end (delta: 429.4 MB). Free memory was 241.1 MB in the beginning and 408.6 MB in the end (delta: -167.6 MB). Peak memory consumption was 409.6 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:19,182 INFO ]: TraceAbstraction took 19339.25 ms. Allocated memory was 736.1 MB in the beginning and 1.0 GB in the end (delta: 295.2 MB). Free memory was 408.6 MB in the beginning and 227.7 MB in the end (delta: 180.9 MB). Peak memory consumption was 476.1 MB. Max. memory is 3.6 GB. [2018-06-25 03:47:19,185 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, 2055 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.88 ms. Allocated memory is still 306.7 MB. Free memory was 259.0 MB in the beginning and 256.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 51.23 ms. Allocated memory is still 306.7 MB. Free memory was 256.0 MB in the beginning and 255.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 346.90 ms. Allocated memory is still 306.7 MB. Free memory was 255.0 MB in the beginning and 241.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 14847.64 ms. Allocated memory was 306.7 MB in the beginning and 736.1 MB in the end (delta: 429.4 MB). Free memory was 241.1 MB in the beginning and 408.6 MB in the end (delta: -167.6 MB). Peak memory consumption was 409.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 19339.25 ms. Allocated memory was 736.1 MB in the beginning and 1.0 GB in the end (delta: 295.2 MB). Free memory was 408.6 MB in the beginning and 227.7 MB in the end (delta: 180.9 MB). Peak memory consumption was 476.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assume !hbv_False_1_Bool; [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_False_2_Int, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Bool, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Bool, hbv_False_14_Bool, hbv_False_15_Int, hbv_False_16_Bool, hbv_False_17_Bool, hbv_False_18_Bool, hbv_False_19_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_21_Bool; [L0] havoc hbv_False_17_Bool, hbv_False_5_Bool, hbv_False_13_Bool, hbv_False_10_Int, hbv_False_11_Int, hbv_False_1_Bool, hbv_False_19_Bool, hbv_False_18_Bool, hbv_False_8_Int, hbv_False_15_Int, hbv_False_4_Bool, hbv_False_20_Bool, hbv_False_3_Bool, hbv_False_12_Int, hbv_False_14_Bool, hbv_False_9_Int, hbv_False_7_Int, hbv_False_2_Int, hbv_False_16_Bool, hbv_False_6_Int, hbv_False_21_Bool; [L0] assume ((((((((((((((((((((((((((((((((((((((!(((hbv_state_2_Bool && !hhv_state_17_Bool) || hhv_state_3_Bool) && ((!hhv_state_3_Bool || !hbv_state_2_Bool) || hhv_state_17_Bool)) && hbv_state_15_Int == hbv_state_12_Int) && hhv_state_7_Int == hhv_state_10_Int) && !(!(hbv_state_11_Int == 1) && (hbv_state_9_Bool || !hbv_state_10_Bool))) && hbv_state_19_Int == hbv_state_13_Int) && hbv_state_4_Int == hbv_state_5_Int) && !((!hhv_state_15_Bool || !hhv_state_14_Bool) && !(hhv_state_5_Int == hhv_state_6_Int))) && hhv_state_4_Int == hhv_state_7_Int) && !(!(hbv_state_12_Int == hbv_state_13_Int) && (!hbv_state_9_Bool || !hbv_state_10_Bool))) && hhv_state_6_Int == hhv_state_0_Int) && !((!hhv_state_16_Bool || !hhv_state_11_Bool) && (hhv_state_16_Bool || hhv_state_11_Bool))) && !((!(hhv_state_8_Int == hhv_state_13_Int) && !hhv_state_15_Bool) && hhv_state_14_Bool)) && hbv_state_11_Int == hbv_state_18_Int) && hhv_state_5_Int == hhv_state_4_Int) && !((!hhv_state_18_Bool || !hhv_state_3_Bool) && (hhv_state_3_Bool || hhv_state_18_Bool))) && !(!(hhv_state_13_Int == 0) && (!hhv_state_14_Bool || hhv_state_15_Bool))) && !((hhv_state_1_Bool || hhv_state_12_Bool) && (!hhv_state_1_Bool || !hhv_state_12_Bool))) && hhv_state_9_Int == hhv_state_8_Int) && !((!hbv_state_6_Bool || !hbv_state_7_Bool) && (hbv_state_6_Bool || hbv_state_7_Bool))) && !(((hhv_state_19_Bool || 10 <= hhv_state_10_Int) && !hbv_state_3_Bool) && (!hhv_state_19_Bool || !(10 <= hhv_state_10_Int)))) && !(((!(hhv_state_10_Int <= -10) || !hhv_state_20_Bool) && (hhv_state_20_Bool || hhv_state_10_Int <= -10)) && !hbv_state_1_Bool)) && !((hbv_state_10_Bool && !hbv_state_9_Bool) && !(hbv_state_14_Int == 2))) && !(!(hbv_state_14_Int == 0) && (hbv_state_9_Bool || !hbv_state_10_Bool))) && !(!(hhv_state_8_Int == 1) && (!hhv_state_14_Bool || hhv_state_15_Bool))) && !((hbv_state_10_Bool && hbv_state_9_Bool) && !(hbv_state_12_Int + (-1 * hbv_state_13_Int + -1 * hbv_state_18_Int) == 0))) && !((!hhv_state_12_Bool || !hhv_state_17_Bool) && (hhv_state_17_Bool || hhv_state_12_Bool))) && !((hbv_state_10_Bool && !hbv_state_9_Bool) && !(hbv_state_11_Int == hbv_state_14_Int))) && hbv_state_4_Int == hhv_state_0_Int) && !(((!(hhv_state_10_Int <= 0) || hhv_state_19_Bool) && hbv_state_3_Bool) && (hhv_state_10_Int <= 0 || !hhv_state_19_Bool))) && !((hbv_state_3_Bool || hbv_state_8_Bool) && (!hbv_state_3_Bool || !hbv_state_8_Bool))) && !(((hhv_state_20_Bool || !(0 <= hhv_state_10_Int)) && hbv_state_1_Bool) && (0 <= hhv_state_10_Int || !hhv_state_20_Bool))) && !((!hbv_state_17_Bool || !hbv_state_1_Bool) && (hbv_state_1_Bool || hbv_state_17_Bool))) && !((!hhv_state_2_Bool || !hhv_state_11_Bool) && (hhv_state_11_Bool || hhv_state_2_Bool))) && !((!(hhv_state_13_Int == 2) && !hhv_state_15_Bool) && hhv_state_14_Bool)) && !((!(hhv_state_5_Int + (-1 * hhv_state_6_Int + -1 * hhv_state_9_Int) == 0) && hhv_state_14_Bool) && hhv_state_15_Bool)) && !((!hhv_state_19_Bool || !hhv_state_2_Bool) && (hhv_state_2_Bool || hhv_state_19_Bool))) && !((hbv_state_1_Bool || hbv_state_16_Bool) && (!hbv_state_16_Bool || !hbv_state_1_Bool))) && !((hhv_state_20_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_20_Bool))) && !((hbv_state_2_Bool || hbv_state_3_Bool) && (!hbv_state_3_Bool || !hbv_state_2_Bool))) && hbv_state_15_Int == hbv_state_4_Int; [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_state_19_Int, hbv_state_17_Bool, hbv_state_8_Bool, hbv_state_6_Bool, hbv_state_15_Int, hbv_state_12_Int, hbv_state_13_Int, hbv_state_4_Int, hbv_state_11_Int, hbv_state_18_Int, hbv_state_5_Int, hbv_state_3_Bool, hbv_state_1_Bool, hbv_state_14_Int, hbv_state_10_Bool, hbv_state_9_Bool, hbv_state_2_Bool, hbv_state_16_Bool, hbv_state_7_Bool, hbv_state_20_Bool, hbv_state_21_Bool; [L0] havoc hbv_state_13_Int, hbv_state_17_Bool, hbv_state_20_Bool, hbv_state_18_Int, hbv_state_6_Bool, hbv_state_19_Int, hbv_state_8_Bool, hbv_state_14_Int, hbv_state_21_Bool, hbv_state_1_Bool, hbv_state_5_Int, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_9_Bool, hbv_state_2_Bool, hbv_state_10_Bool, hbv_state_16_Bool, hbv_state_4_Int, hbv_state_7_Bool, hbv_state_12_Int, hbv_state_15_Int; [L0] RET call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. UNSAFE Result, 19.2s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 15.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9672 SDtfs, 1 SDslu, 94 SDs, 0 SdLazy, 5806 SolverSat, 4241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 1295 SizeOfPredicates, 15 NumberOfNonLiveVariables, 761 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 13/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e8_220_e7_249.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_03-47-19-196.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e8_220_e7_249.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_03-47-19-196.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e8_220_e7_249.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_03-47-19-196.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e8_220_e7_249.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_03-47-19-196.csv Received shutdown request...