java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e7_353.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 06:57:28,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 06:57:28,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 06:57:28,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 06:57:28,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 06:57:28,971 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 06:57:28,972 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 06:57:28,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 06:57:28,977 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 06:57:28,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 06:57:28,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 06:57:28,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 06:57:28,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 06:57:28,982 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 06:57:28,986 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 06:57:28,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 06:57:29,000 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 06:57:29,002 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 06:57:29,003 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 06:57:29,004 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 06:57:29,005 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 06:57:29,007 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 06:57:29,008 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 06:57:29,008 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 06:57:29,012 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 06:57:29,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 06:57:29,014 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 06:57:29,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 06:57:29,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 06:57:29,022 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 06:57:29,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 06:57:29,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 06:57:29,024 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 06:57:29,024 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 06:57:29,025 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 06:57:29,025 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 06:57:29,050 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 06:57:29,051 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 06:57:29,054 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 06:57:29,054 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 06:57:29,055 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 06:57:29,055 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 06:57:29,055 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 06:57:29,056 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 06:57:29,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 06:57:29,056 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 06:57:29,056 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 06:57:29,056 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 06:57:29,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:57:29,058 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 06:57:29,058 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 06:57:29,058 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 06:57:29,058 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 06:57:29,058 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 06:57:29,059 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 06:57:29,059 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 06:57:29,059 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 06:57:29,060 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 06:57:29,060 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 06:57:29,107 INFO ]: Repository-Root is: /tmp [2018-06-25 06:57:29,123 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 06:57:29,128 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 06:57:29,129 INFO ]: Initializing SmtParser... [2018-06-25 06:57:29,130 INFO ]: SmtParser initialized [2018-06-25 06:57:29,130 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e7_353.smt2 [2018-06-25 06:57:29,131 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 06:57:29,220 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e7_353.smt2 unknown [2018-06-25 06:57:29,466 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449_e7_353.smt2 [2018-06-25 06:57:29,471 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 06:57:29,477 INFO ]: Walking toolchain with 5 elements. [2018-06-25 06:57:29,478 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 06:57:29,478 INFO ]: Initializing ChcToBoogie... [2018-06-25 06:57:29,478 INFO ]: ChcToBoogie initialized [2018-06-25 06:57:29,481 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:57:29" (1/1) ... [2018-06-25 06:57:29,546 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:29 Unit [2018-06-25 06:57:29,546 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 06:57:29,547 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 06:57:29,547 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 06:57:29,547 INFO ]: Boogie Preprocessor initialized [2018-06-25 06:57:29,568 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:29" (1/1) ... [2018-06-25 06:57:29,569 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:29" (1/1) ... [2018-06-25 06:57:29,577 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:29" (1/1) ... [2018-06-25 06:57:29,577 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:29" (1/1) ... [2018-06-25 06:57:29,589 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:29" (1/1) ... [2018-06-25 06:57:29,591 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:29" (1/1) ... [2018-06-25 06:57:29,593 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:29" (1/1) ... [2018-06-25 06:57:29,595 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 06:57:29,595 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 06:57:29,595 INFO ]: Initializing RCFGBuilder... [2018-06-25 06:57:29,596 INFO ]: RCFGBuilder initialized [2018-06-25 06:57:29,597 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:29" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 06:57:29,613 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 06:57:29,613 INFO ]: Found specification of procedure gotoProc [2018-06-25 06:57:29,613 INFO ]: Found implementation of procedure gotoProc [2018-06-25 06:57:29,613 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 06:57:29,613 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 06:57:29,613 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:57:29,918 INFO ]: Using library mode [2018-06-25 06:57:29,928 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:57:29 BoogieIcfgContainer [2018-06-25 06:57:29,928 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 06:57:29,928 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 06:57:29,928 INFO ]: Initializing BlockEncodingV2... [2018-06-25 06:57:29,930 INFO ]: BlockEncodingV2 initialized [2018-06-25 06:57:29,930 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:57:29" (1/1) ... [2018-06-25 06:57:29,961 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 06:57:29,962 INFO ]: Using Remove infeasible edges [2018-06-25 06:57:29,962 INFO ]: Using Maximize final states [2018-06-25 06:57:29,963 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 06:57:29,963 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 06:57:29,965 INFO ]: Using Remove sink states [2018-06-25 06:57:29,965 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 06:57:29,965 INFO ]: Using Use SBE [2018-06-25 06:57:29,971 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:57:32,041 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:57:32,256 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:57:32,550 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:57:32,551 INFO ]: SBE split 2 edges [2018-06-25 06:57:32,566 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 06:57:32,570 INFO ]: 0 new accepting states [2018-06-25 06:57:46,764 INFO ]: Removed 2058 edges and 2 locations by large block encoding [2018-06-25 06:57:46,768 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:46,782 INFO ]: Removed 5 edges and 0 locations because of local infeasibility [2018-06-25 06:57:46,783 INFO ]: 0 new accepting states [2018-06-25 06:57:46,785 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:57:46,785 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:46,792 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 06:57:46,794 INFO ]: 0 new accepting states [2018-06-25 06:57:46,796 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:57:46,797 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:46,806 INFO ]: Encoded RCFG 6 locations, 2055 edges [2018-06-25 06:57:46,806 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:57:46 BasicIcfg [2018-06-25 06:57:46,806 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 06:57:46,807 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 06:57:46,807 INFO ]: Initializing TraceAbstraction... [2018-06-25 06:57:46,812 INFO ]: TraceAbstraction initialized [2018-06-25 06:57:46,812 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:57:29" (1/4) ... [2018-06-25 06:57:46,813 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659f5e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 06:57:46, skipping insertion in model container [2018-06-25 06:57:46,813 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:57:29" (2/4) ... [2018-06-25 06:57:46,814 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659f5e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 06:57:46, skipping insertion in model container [2018-06-25 06:57:46,814 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:57:29" (3/4) ... [2018-06-25 06:57:46,814 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659f5e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:57:46, skipping insertion in model container [2018-06-25 06:57:46,814 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:57:46" (4/4) ... [2018-06-25 06:57:46,816 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 06:57:46,827 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 06:57:46,835 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 06:57:46,882 INFO ]: Using default assertion order modulation [2018-06-25 06:57:46,883 INFO ]: Interprodecural is true [2018-06-25 06:57:46,883 INFO ]: Hoare is false [2018-06-25 06:57:46,883 INFO ]: Compute interpolants for FPandBP [2018-06-25 06:57:46,883 INFO ]: Backedges is TWOTRACK [2018-06-25 06:57:46,883 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 06:57:46,883 INFO ]: Difference is false [2018-06-25 06:57:46,883 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 06:57:46,883 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 06:57:46,905 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 06:57:46,924 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:46,924 INFO ]: Found error trace [2018-06-25 06:57:46,925 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:46,925 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:46,930 INFO ]: Analyzing trace with hash 161071571, now seen corresponding path program 1 times [2018-06-25 06:57:46,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:46,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:46,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:46,980 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:46,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:47,029 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:47,128 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:47,131 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:47,131 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:47,133 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:47,146 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:47,147 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:47,149 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 06:57:50,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:50,425 INFO ]: Finished difference Result 7 states and 2056 transitions. [2018-06-25 06:57:50,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:50,426 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:50,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:50,440 INFO ]: With dead ends: 7 [2018-06-25 06:57:50,440 INFO ]: Without dead ends: 7 [2018-06-25 06:57:50,441 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:50,469 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:50,511 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:50,512 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:50,515 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2056 transitions. [2018-06-25 06:57:50,517 INFO ]: Start accepts. Automaton has 7 states and 2056 transitions. Word has length 5 [2018-06-25 06:57:50,518 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:50,518 INFO ]: Abstraction has 7 states and 2056 transitions. [2018-06-25 06:57:50,518 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:50,518 INFO ]: Start isEmpty. Operand 7 states and 2056 transitions. [2018-06-25 06:57:50,519 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:50,519 INFO ]: Found error trace [2018-06-25 06:57:50,519 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:50,519 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:50,519 INFO ]: Analyzing trace with hash 161101362, now seen corresponding path program 1 times [2018-06-25 06:57:50,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:50,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:50,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:50,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:50,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:50,530 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:50,595 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:50,596 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:50,596 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:50,597 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:50,597 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:50,597 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:50,597 INFO ]: Start difference. First operand 7 states and 2056 transitions. Second operand 3 states. [2018-06-25 06:57:53,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:53,389 INFO ]: Finished difference Result 8 states and 2057 transitions. [2018-06-25 06:57:53,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:53,389 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:53,389 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:53,392 INFO ]: With dead ends: 8 [2018-06-25 06:57:53,392 INFO ]: Without dead ends: 8 [2018-06-25 06:57:53,393 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:53,393 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:53,405 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:57:53,406 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:53,409 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2056 transitions. [2018-06-25 06:57:53,410 INFO ]: Start accepts. Automaton has 7 states and 2056 transitions. Word has length 5 [2018-06-25 06:57:53,410 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:53,410 INFO ]: Abstraction has 7 states and 2056 transitions. [2018-06-25 06:57:53,410 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:53,410 INFO ]: Start isEmpty. Operand 7 states and 2056 transitions. [2018-06-25 06:57:53,411 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:53,411 INFO ]: Found error trace [2018-06-25 06:57:53,411 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:53,411 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:53,411 INFO ]: Analyzing trace with hash 579695877, now seen corresponding path program 1 times [2018-06-25 06:57:53,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:53,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:53,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:53,412 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:53,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:53,452 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:53,526 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:53,526 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:53,526 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:53,526 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:53,526 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:53,526 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:53,526 INFO ]: Start difference. First operand 7 states and 2056 transitions. Second operand 3 states. [2018-06-25 06:57:56,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:56,334 INFO ]: Finished difference Result 8 states and 2056 transitions. [2018-06-25 06:57:56,334 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:56,334 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:56,334 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:56,335 INFO ]: With dead ends: 8 [2018-06-25 06:57:56,335 INFO ]: Without dead ends: 7 [2018-06-25 06:57:56,336 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:56,336 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:56,344 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:56,345 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:56,347 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1032 transitions. [2018-06-25 06:57:56,347 INFO ]: Start accepts. Automaton has 7 states and 1032 transitions. Word has length 6 [2018-06-25 06:57:56,347 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:56,347 INFO ]: Abstraction has 7 states and 1032 transitions. [2018-06-25 06:57:56,347 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:56,347 INFO ]: Start isEmpty. Operand 7 states and 1032 transitions. [2018-06-25 06:57:56,348 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:56,348 INFO ]: Found error trace [2018-06-25 06:57:56,348 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:56,348 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:56,348 INFO ]: Analyzing trace with hash 580619398, now seen corresponding path program 1 times [2018-06-25 06:57:56,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:56,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:56,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:56,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:56,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:56,372 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:56,406 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:56,406 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:56,407 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:56,407 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:56,407 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:56,407 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:56,407 INFO ]: Start difference. First operand 7 states and 1032 transitions. Second operand 3 states. [2018-06-25 06:57:57,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:57,338 INFO ]: Finished difference Result 8 states and 1032 transitions. [2018-06-25 06:57:57,338 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:57,338 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:57,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:57,340 INFO ]: With dead ends: 8 [2018-06-25 06:57:57,340 INFO ]: Without dead ends: 7 [2018-06-25 06:57:57,340 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:57,340 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:57,347 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:57,347 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:57,349 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 776 transitions. [2018-06-25 06:57:57,349 INFO ]: Start accepts. Automaton has 7 states and 776 transitions. Word has length 6 [2018-06-25 06:57:57,349 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:57,349 INFO ]: Abstraction has 7 states and 776 transitions. [2018-06-25 06:57:57,350 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:57,350 INFO ]: Start isEmpty. Operand 7 states and 776 transitions. [2018-06-25 06:57:57,350 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:57,350 INFO ]: Found error trace [2018-06-25 06:57:57,350 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:57,350 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:57,350 INFO ]: Analyzing trace with hash -365989627, now seen corresponding path program 1 times [2018-06-25 06:57:57,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:57,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:57,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:57,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:57,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:57,386 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:57,447 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:57,447 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:57,447 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:57,447 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:57,447 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:57,447 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:57,447 INFO ]: Start difference. First operand 7 states and 776 transitions. Second operand 3 states. [2018-06-25 06:57:58,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:58,128 INFO ]: Finished difference Result 8 states and 776 transitions. [2018-06-25 06:57:58,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:58,128 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:58,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:58,129 INFO ]: With dead ends: 8 [2018-06-25 06:57:58,129 INFO ]: Without dead ends: 7 [2018-06-25 06:57:58,129 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:58,129 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:58,133 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:58,133 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:58,134 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 648 transitions. [2018-06-25 06:57:58,134 INFO ]: Start accepts. Automaton has 7 states and 648 transitions. Word has length 6 [2018-06-25 06:57:58,135 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:58,135 INFO ]: Abstraction has 7 states and 648 transitions. [2018-06-25 06:57:58,135 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:58,135 INFO ]: Start isEmpty. Operand 7 states and 648 transitions. [2018-06-25 06:57:58,135 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:58,135 INFO ]: Found error trace [2018-06-25 06:57:58,135 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:58,135 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:58,135 INFO ]: Analyzing trace with hash -365066106, now seen corresponding path program 1 times [2018-06-25 06:57:58,135 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:58,135 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:58,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:58,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:58,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:58,165 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:58,237 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:58,237 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:58,237 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:58,237 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:58,238 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:58,238 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:58,238 INFO ]: Start difference. First operand 7 states and 648 transitions. Second operand 3 states. [2018-06-25 06:57:58,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:58,855 INFO ]: Finished difference Result 8 states and 648 transitions. [2018-06-25 06:57:58,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:58,987 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:58,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:58,988 INFO ]: With dead ends: 8 [2018-06-25 06:57:58,988 INFO ]: Without dead ends: 7 [2018-06-25 06:57:58,988 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:58,988 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:58,991 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:58,991 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:58,992 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 392 transitions. [2018-06-25 06:57:58,992 INFO ]: Start accepts. Automaton has 7 states and 392 transitions. Word has length 6 [2018-06-25 06:57:58,992 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:58,992 INFO ]: Abstraction has 7 states and 392 transitions. [2018-06-25 06:57:58,992 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:58,992 INFO ]: Start isEmpty. Operand 7 states and 392 transitions. [2018-06-25 06:57:58,992 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:58,992 INFO ]: Found error trace [2018-06-25 06:57:58,992 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:58,992 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:58,992 INFO ]: Analyzing trace with hash 581542919, now seen corresponding path program 1 times [2018-06-25 06:57:58,992 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:58,992 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:58,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:58,993 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:58,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:59,007 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:59,093 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:59,093 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:59,093 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:59,093 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:59,093 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:59,093 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:59,094 INFO ]: Start difference. First operand 7 states and 392 transitions. Second operand 3 states. [2018-06-25 06:57:59,426 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:59,427 INFO ]: Finished difference Result 8 states and 392 transitions. [2018-06-25 06:57:59,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:59,430 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:59,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:59,431 INFO ]: With dead ends: 8 [2018-06-25 06:57:59,431 INFO ]: Without dead ends: 7 [2018-06-25 06:57:59,431 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:59,431 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:59,433 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:59,433 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:59,433 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2018-06-25 06:57:59,433 INFO ]: Start accepts. Automaton has 7 states and 200 transitions. Word has length 6 [2018-06-25 06:57:59,433 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:59,433 INFO ]: Abstraction has 7 states and 200 transitions. [2018-06-25 06:57:59,433 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:59,433 INFO ]: Start isEmpty. Operand 7 states and 200 transitions. [2018-06-25 06:57:59,433 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:59,433 INFO ]: Found error trace [2018-06-25 06:57:59,434 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:59,434 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:59,436 INFO ]: Analyzing trace with hash 582466440, now seen corresponding path program 1 times [2018-06-25 06:57:59,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:59,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:59,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:59,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:59,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:59,454 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:59,481 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:59,481 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:59,481 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:59,481 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:59,481 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:59,481 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:59,481 INFO ]: Start difference. First operand 7 states and 200 transitions. Second operand 3 states. [2018-06-25 06:57:59,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:59,644 INFO ]: Finished difference Result 8 states and 200 transitions. [2018-06-25 06:57:59,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:59,644 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:59,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:59,645 INFO ]: With dead ends: 8 [2018-06-25 06:57:59,645 INFO ]: Without dead ends: 7 [2018-06-25 06:57:59,646 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:59,646 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:59,646 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:59,646 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:59,647 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2018-06-25 06:57:59,647 INFO ]: Start accepts. Automaton has 7 states and 104 transitions. Word has length 6 [2018-06-25 06:57:59,647 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:59,647 INFO ]: Abstraction has 7 states and 104 transitions. [2018-06-25 06:57:59,647 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:59,647 INFO ]: Start isEmpty. Operand 7 states and 104 transitions. [2018-06-25 06:57:59,647 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:59,647 INFO ]: Found error trace [2018-06-25 06:57:59,647 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:59,647 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:59,647 INFO ]: Analyzing trace with hash -1193464443, now seen corresponding path program 1 times [2018-06-25 06:57:59,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:59,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:59,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:59,648 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:59,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:59,662 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:59,758 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:59,758 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:59,758 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:59,758 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:59,758 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:59,758 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:59,758 INFO ]: Start difference. First operand 7 states and 104 transitions. Second operand 3 states. [2018-06-25 06:57:59,842 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:59,842 INFO ]: Finished difference Result 8 states and 104 transitions. [2018-06-25 06:57:59,843 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:59,843 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:59,843 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:59,843 INFO ]: With dead ends: 8 [2018-06-25 06:57:59,843 INFO ]: Without dead ends: 7 [2018-06-25 06:57:59,843 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:59,843 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:59,844 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:59,844 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:59,844 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-06-25 06:57:59,844 INFO ]: Start accepts. Automaton has 7 states and 56 transitions. Word has length 6 [2018-06-25 06:57:59,844 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:59,844 INFO ]: Abstraction has 7 states and 56 transitions. [2018-06-25 06:57:59,845 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:59,845 INFO ]: Start isEmpty. Operand 7 states and 56 transitions. [2018-06-25 06:57:59,845 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:59,845 INFO ]: Found error trace [2018-06-25 06:57:59,845 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:59,845 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:59,845 INFO ]: Analyzing trace with hash -11357563, now seen corresponding path program 1 times [2018-06-25 06:57:59,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:59,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:59,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:59,846 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:59,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:59,855 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:59,891 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:59,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:57:59,891 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:57:59,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:59,952 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:59,964 INFO ]: Computing forward predicates... [2018-06-25 06:58:00,034 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:00,072 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:00,072 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 06:58:00,072 INFO ]: Interpolant automaton has 4 states [2018-06-25 06:58:00,072 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 06:58:00,072 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 06:58:00,072 INFO ]: Start difference. First operand 7 states and 56 transitions. Second operand 4 states. [2018-06-25 06:58:01,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:01,321 INFO ]: Finished difference Result 9 states and 57 transitions. [2018-06-25 06:58:01,322 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:58:01,322 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 06:58:01,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:01,322 INFO ]: With dead ends: 9 [2018-06-25 06:58:01,322 INFO ]: Without dead ends: 8 [2018-06-25 06:58:01,323 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:58:01,323 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:58:01,323 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:58:01,323 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:58:01,324 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-25 06:58:01,324 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 6 [2018-06-25 06:58:01,324 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:01,324 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-25 06:58:01,324 INFO ]: Interpolant automaton has 4 states. [2018-06-25 06:58:01,324 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-25 06:58:01,324 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:58:01,324 INFO ]: Found error trace [2018-06-25 06:58:01,324 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:58:01,324 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:01,324 INFO ]: Analyzing trace with hash -470639981, now seen corresponding path program 2 times [2018-06-25 06:58:01,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:01,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:01,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:01,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:01,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:01,350 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:01,616 WARN ]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 06:58:01,892 WARN ]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 06:58:02,044 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:02,044 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:02,044 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:58:02,056 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 06:58:02,128 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 06:58:02,128 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:02,132 INFO ]: Computing forward predicates... [2018-06-25 06:58:02,516 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:02,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:02,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:58:02,537 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:58:02,537 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:58:02,537 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:58:02,537 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 8 states. [2018-06-25 06:58:02,901 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 06:58:03,138 WARN ]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-25 06:58:03,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:03,965 INFO ]: Finished difference Result 13 states and 27 transitions. [2018-06-25 06:58:04,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 06:58:04,026 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:58:04,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:04,026 INFO ]: With dead ends: 13 [2018-06-25 06:58:04,026 INFO ]: Without dead ends: 8 [2018-06-25 06:58:04,027 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-06-25 06:58:04,027 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:58:04,027 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:58:04,028 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:58:04,028 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-06-25 06:58:04,028 INFO ]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 7 [2018-06-25 06:58:04,028 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:04,028 INFO ]: Abstraction has 8 states and 13 transitions. [2018-06-25 06:58:04,028 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:58:04,028 INFO ]: Start isEmpty. Operand 8 states and 13 transitions. [2018-06-25 06:58:04,028 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:58:04,028 INFO ]: Found error trace [2018-06-25 06:58:04,028 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:58:04,028 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:04,028 INFO ]: Analyzing trace with hash 1163600210, now seen corresponding path program 1 times [2018-06-25 06:58:04,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:04,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:04,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:04,029 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 06:58:04,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:04,046 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:04,164 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:58:04,164 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:04,164 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:04,164 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:04,164 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:04,164 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:04,164 INFO ]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2018-06-25 06:58:04,222 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:04,223 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-25 06:58:04,223 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:04,223 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 06:58:04,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:04,223 INFO ]: With dead ends: 9 [2018-06-25 06:58:04,223 INFO ]: Without dead ends: 8 [2018-06-25 06:58:04,223 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:04,223 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:58:04,224 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:58:04,224 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:58:04,224 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-25 06:58:04,224 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2018-06-25 06:58:04,224 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:04,224 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-25 06:58:04,224 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:04,224 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-25 06:58:04,224 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:58:04,224 INFO ]: Found error trace [2018-06-25 06:58:04,224 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:58:04,225 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:04,225 INFO ]: Analyzing trace with hash -640036303, now seen corresponding path program 1 times [2018-06-25 06:58:04,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:04,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:04,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:04,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:04,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:04,241 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:04,313 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:04,313 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:04,313 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:58:04,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:04,367 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:04,370 INFO ]: Computing forward predicates... [2018-06-25 06:58:04,460 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:04,482 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:04,482 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:58:04,483 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:58:04,483 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:58:04,483 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:58:04,483 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 8 states. [2018-06-25 06:58:04,998 WARN ]: Spent 419.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-06-25 06:58:05,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:05,308 INFO ]: Finished difference Result 10 states and 12 transitions. [2018-06-25 06:58:05,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:58:05,308 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:58:05,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:05,308 INFO ]: With dead ends: 10 [2018-06-25 06:58:05,308 INFO ]: Without dead ends: 8 [2018-06-25 06:58:05,309 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-25 06:58:05,309 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:58:05,309 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:58:05,309 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:58:05,310 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-06-25 06:58:05,310 INFO ]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 7 [2018-06-25 06:58:05,310 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:05,310 INFO ]: Abstraction has 8 states and 10 transitions. [2018-06-25 06:58:05,310 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:58:05,310 INFO ]: Start isEmpty. Operand 8 states and 10 transitions. [2018-06-25 06:58:05,310 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:58:05,310 INFO ]: Found error trace [2018-06-25 06:58:05,310 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:58:05,310 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:05,310 INFO ]: Analyzing trace with hash 307698910, now seen corresponding path program 1 times [2018-06-25 06:58:05,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:05,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:05,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:05,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:05,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:05,324 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:05,947 WARN ]: Spent 554.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-06-25 06:58:06,227 WARN ]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 06:58:06,379 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:06,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:06,380 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 06:58:06,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:58:06,450 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:06,453 INFO ]: Computing forward predicates... [2018-06-25 06:58:06,585 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:58:06,661 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:06,680 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:06,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:58:06,680 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:58:06,681 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:58:06,681 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:58:06,681 INFO ]: Start difference. First operand 8 states and 10 transitions. Second operand 8 states. [2018-06-25 06:58:06,739 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:06,739 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-25 06:58:06,739 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 06:58:06,739 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:58:06,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:06,740 INFO ]: With dead ends: 4 [2018-06-25 06:58:06,740 INFO ]: Without dead ends: 0 [2018-06-25 06:58:06,740 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-25 06:58:06,740 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 06:58:06,740 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 06:58:06,740 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 06:58:06,740 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 06:58:06,740 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 06:58:06,740 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:06,740 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 06:58:06,740 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:58:06,740 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 06:58:06,740 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 06:58:06,742 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 06:58:06,743 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:58:06 BasicIcfg [2018-06-25 06:58:06,743 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 06:58:06,744 INFO ]: Toolchain (without parser) took 37271.92 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 750.3 MB). Free memory was 261.2 MB in the beginning and 368.9 MB in the end (delta: -107.7 MB). Peak memory consumption was 642.5 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:06,744 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:58:06,744 INFO ]: ChcToBoogie took 68.96 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 257.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:06,745 INFO ]: Boogie Preprocessor took 47.80 ms. Allocated memory is still 308.8 MB. Free memory is still 257.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:58:06,745 INFO ]: RCFGBuilder took 332.55 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 243.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:06,745 INFO ]: BlockEncodingV2 took 16877.91 ms. Allocated memory was 308.8 MB in the beginning and 740.3 MB in the end (delta: 431.5 MB). Free memory was 243.2 MB in the beginning and 452.5 MB in the end (delta: -209.2 MB). Peak memory consumption was 424.5 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:06,746 INFO ]: TraceAbstraction took 19935.56 ms. Allocated memory was 740.3 MB in the beginning and 1.1 GB in the end (delta: 318.8 MB). Free memory was 452.5 MB in the beginning and 368.9 MB in the end (delta: 83.6 MB). Peak memory consumption was 402.3 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:06,750 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 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 68.96 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 257.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 47.80 ms. Allocated memory is still 308.8 MB. Free memory is still 257.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 332.55 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 243.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 16877.91 ms. Allocated memory was 308.8 MB in the beginning and 740.3 MB in the end (delta: 431.5 MB). Free memory was 243.2 MB in the beginning and 452.5 MB in the end (delta: -209.2 MB). Peak memory consumption was 424.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 19935.56 ms. Allocated memory was 740.3 MB in the beginning and 1.1 GB in the end (delta: 318.8 MB). Free memory was 452.5 MB in the beginning and 368.9 MB in the end (delta: 83.6 MB). Peak memory consumption was 402.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 19.8s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9406 SDtfs, 0 SDslu, 78 SDs, 0 SdLazy, 4375 SolverSat, 5191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=10, 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, 14 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 1323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1007 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 10/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e7_353.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_06-58-06-761.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e7_353.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_06-58-06-761.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e7_353.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_06-58-06-761.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449_e7_353.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_06-58-06-761.csv Received shutdown request...