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/hysteresis_2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-27 01:14:51,822 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-27 01:14:51,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-27 01:14:51,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-27 01:14:51,835 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-27 01:14:51,836 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-27 01:14:51,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-27 01:14:51,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-27 01:14:51,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-27 01:14:51,840 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-27 01:14:51,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-27 01:14:51,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-27 01:14:51,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-27 01:14:51,844 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-27 01:14:51,845 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-27 01:14:51,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-27 01:14:51,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-27 01:14:51,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-27 01:14:51,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-27 01:14:51,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-27 01:14:51,852 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-27 01:14:51,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-27 01:14:51,856 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-27 01:14:51,856 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-27 01:14:51,856 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-27 01:14:51,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-27 01:14:51,858 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-27 01:14:51,858 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-27 01:14:51,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-27 01:14:51,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-27 01:14:51,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-27 01:14:51,861 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-27 01:14:51,861 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-27 01:14:51,862 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-27 01:14:51,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-27 01:14:51,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-27 01:14:51,863 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-27 01:14:51,877 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-27 01:14:51,877 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-27 01:14:51,877 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-27 01:14:51,878 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-27 01:14:51,879 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-27 01:14:51,879 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-27 01:14:51,879 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-27 01:14:51,879 INFO L133 SettingsManager]: * Use SBE=true [2018-06-27 01:14:51,879 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-27 01:14:51,880 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-27 01:14:51,880 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-27 01:14:51,880 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-27 01:14:51,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 01:14:51,880 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-27 01:14:51,881 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-27 01:14:51,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-27 01:14:51,881 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-27 01:14:51,881 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-27 01:14:51,881 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-27 01:14:51,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-27 01:14:51,882 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-27 01:14:51,883 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-27 01:14:51,883 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-27 01:14:51,931 INFO ]: Repository-Root is: /tmp [2018-06-27 01:14:51,951 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-27 01:14:51,958 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-27 01:14:51,959 INFO ]: Initializing SmtParser... [2018-06-27 01:14:51,960 INFO ]: SmtParser initialized [2018-06-27 01:14:51,960 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_2.smt2 [2018-06-27 01:14:51,962 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-27 01:14:52,054 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_2.smt2 unknown [2018-06-27 01:14:52,278 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_2.smt2 [2018-06-27 01:14:52,282 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-27 01:14:52,289 INFO ]: Walking toolchain with 5 elements. [2018-06-27 01:14:52,289 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-27 01:14:52,289 INFO ]: Initializing ChcToBoogie... [2018-06-27 01:14:52,290 INFO ]: ChcToBoogie initialized [2018-06-27 01:14:52,293 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 01:14:52" (1/1) ... [2018-06-27 01:14:52,349 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:14:52 Unit [2018-06-27 01:14:52,350 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-27 01:14:52,350 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-27 01:14:52,350 INFO ]: Initializing Boogie Preprocessor... [2018-06-27 01:14:52,350 INFO ]: Boogie Preprocessor initialized [2018-06-27 01:14:52,373 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:14:52" (1/1) ... [2018-06-27 01:14:52,373 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:14:52" (1/1) ... [2018-06-27 01:14:52,384 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:14:52" (1/1) ... [2018-06-27 01:14:52,384 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:14:52" (1/1) ... [2018-06-27 01:14:52,399 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:14:52" (1/1) ... [2018-06-27 01:14:52,401 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:14:52" (1/1) ... [2018-06-27 01:14:52,402 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:14:52" (1/1) ... [2018-06-27 01:14:52,404 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-27 01:14:52,405 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-27 01:14:52,405 INFO ]: Initializing RCFGBuilder... [2018-06-27 01:14:52,405 INFO ]: RCFGBuilder initialized [2018-06-27 01:14:52,406 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:14:52" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 01:14:52,426 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-27 01:14:52,426 INFO ]: Found specification of procedure gotoProc [2018-06-27 01:14:52,426 INFO ]: Found implementation of procedure gotoProc [2018-06-27 01:14:52,426 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-27 01:14:52,426 INFO ]: Found specification of procedure Ultimate.START [2018-06-27 01:14:52,426 INFO ]: Found implementation of procedure Ultimate.START [2018-06-27 01:14:52,708 INFO ]: Using library mode [2018-06-27 01:14:52,708 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 01:14:52 BoogieIcfgContainer [2018-06-27 01:14:52,709 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-27 01:14:52,709 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-27 01:14:52,709 INFO ]: Initializing BlockEncodingV2... [2018-06-27 01:14:52,710 INFO ]: BlockEncodingV2 initialized [2018-06-27 01:14:52,711 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 01:14:52" (1/1) ... [2018-06-27 01:14:52,725 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-27 01:14:52,727 INFO ]: Using Remove infeasible edges [2018-06-27 01:14:52,727 INFO ]: Using Maximize final states [2018-06-27 01:14:52,728 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-27 01:14:52,728 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-27 01:14:52,730 INFO ]: Using Remove sink states [2018-06-27 01:14:52,730 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-27 01:14:52,730 INFO ]: Using Use SBE [2018-06-27 01:14:52,736 WARN ]: expecting exponential blowup for input size 12 [2018-06-27 01:14:53,406 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 01:14:53,711 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 01:14:53,979 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 01:14:53,983 INFO ]: SBE split 2 edges [2018-06-27 01:14:54,015 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-27 01:14:54,018 INFO ]: 0 new accepting states [2018-06-27 01:15:09,781 INFO ]: Removed 2101 edges and 2 locations by large block encoding [2018-06-27 01:15:09,783 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 01:15:09,821 INFO ]: Removed 44 edges and 0 locations because of local infeasibility [2018-06-27 01:15:09,822 INFO ]: 0 new accepting states [2018-06-27 01:15:09,824 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 01:15:09,824 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 01:15:09,831 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-27 01:15:09,832 INFO ]: 0 new accepting states [2018-06-27 01:15:09,834 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 01:15:09,834 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 01:15:09,846 INFO ]: Encoded RCFG 6 locations, 2059 edges [2018-06-27 01:15:09,846 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 01:15:09 BasicIcfg [2018-06-27 01:15:09,846 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-27 01:15:09,848 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-27 01:15:09,848 INFO ]: Initializing TraceAbstraction... [2018-06-27 01:15:09,854 INFO ]: TraceAbstraction initialized [2018-06-27 01:15:09,854 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 01:14:52" (1/4) ... [2018-06-27 01:15:09,855 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89c99e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 27.06 01:15:09, skipping insertion in model container [2018-06-27 01:15:09,855 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:14:52" (2/4) ... [2018-06-27 01:15:09,855 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89c99e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 01:15:09, skipping insertion in model container [2018-06-27 01:15:09,855 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 01:14:52" (3/4) ... [2018-06-27 01:15:09,855 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89c99e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 01:15:09, skipping insertion in model container [2018-06-27 01:15:09,855 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 01:15:09" (4/4) ... [2018-06-27 01:15:09,858 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-27 01:15:09,867 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-27 01:15:09,875 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-27 01:15:09,929 INFO ]: Using default assertion order modulation [2018-06-27 01:15:09,930 INFO ]: Interprodecural is true [2018-06-27 01:15:09,930 INFO ]: Hoare is false [2018-06-27 01:15:09,930 INFO ]: Compute interpolants for FPandBP [2018-06-27 01:15:09,930 INFO ]: Backedges is TWOTRACK [2018-06-27 01:15:09,930 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-27 01:15:09,930 INFO ]: Difference is false [2018-06-27 01:15:09,930 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-27 01:15:09,930 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-27 01:15:09,953 INFO ]: Start isEmpty. Operand 6 states. [2018-06-27 01:15:09,977 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 01:15:09,977 INFO ]: Found error trace [2018-06-27 01:15:09,978 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 01:15:09,978 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:09,985 INFO ]: Analyzing trace with hash 161116738, now seen corresponding path program 1 times [2018-06-27 01:15:09,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:09,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:10,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:10,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:10,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:10,079 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:10,188 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:10,190 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:10,191 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:10,192 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:10,207 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:10,207 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:10,210 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-27 01:15:14,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:14,507 INFO ]: Finished difference Result 7 states and 2060 transitions. [2018-06-27 01:15:14,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:14,509 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 01:15:14,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:14,535 INFO ]: With dead ends: 7 [2018-06-27 01:15:14,535 INFO ]: Without dead ends: 7 [2018-06-27 01:15:14,538 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:14,558 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:15:14,608 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:15:14,609 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:15:14,616 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2060 transitions. [2018-06-27 01:15:14,617 INFO ]: Start accepts. Automaton has 7 states and 2060 transitions. Word has length 5 [2018-06-27 01:15:14,618 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:14,618 INFO ]: Abstraction has 7 states and 2060 transitions. [2018-06-27 01:15:14,618 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:14,618 INFO ]: Start isEmpty. Operand 7 states and 2060 transitions. [2018-06-27 01:15:14,620 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 01:15:14,620 INFO ]: Found error trace [2018-06-27 01:15:14,620 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 01:15:14,621 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:14,621 INFO ]: Analyzing trace with hash 161176320, now seen corresponding path program 1 times [2018-06-27 01:15:14,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:14,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:14,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:14,622 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:14,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:14,637 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:14,697 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:14,697 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:14,697 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:14,699 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:14,699 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:14,699 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:14,699 INFO ]: Start difference. First operand 7 states and 2060 transitions. Second operand 3 states. [2018-06-27 01:15:17,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:17,986 INFO ]: Finished difference Result 10 states and 2067 transitions. [2018-06-27 01:15:17,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:17,986 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 01:15:17,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:17,990 INFO ]: With dead ends: 10 [2018-06-27 01:15:17,990 INFO ]: Without dead ends: 10 [2018-06-27 01:15:17,991 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:17,991 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-27 01:15:18,004 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-27 01:15:18,004 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:15:18,009 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2065 transitions. [2018-06-27 01:15:18,009 INFO ]: Start accepts. Automaton has 8 states and 2065 transitions. Word has length 5 [2018-06-27 01:15:18,010 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:18,010 INFO ]: Abstraction has 8 states and 2065 transitions. [2018-06-27 01:15:18,010 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:18,010 INFO ]: Start isEmpty. Operand 8 states and 2065 transitions. [2018-06-27 01:15:18,011 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 01:15:18,011 INFO ]: Found error trace [2018-06-27 01:15:18,011 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 01:15:18,011 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:18,011 INFO ]: Analyzing trace with hash 161212838, now seen corresponding path program 1 times [2018-06-27 01:15:18,011 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:18,011 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:18,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:18,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:18,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:18,023 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:18,059 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:18,059 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:18,059 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:18,059 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:18,059 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:18,059 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:18,060 INFO ]: Start difference. First operand 8 states and 2065 transitions. Second operand 3 states. [2018-06-27 01:15:20,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:20,434 INFO ]: Finished difference Result 9 states and 2062 transitions. [2018-06-27 01:15:20,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:20,434 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 01:15:20,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:20,437 INFO ]: With dead ends: 9 [2018-06-27 01:15:20,437 INFO ]: Without dead ends: 9 [2018-06-27 01:15:20,437 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:20,437 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 01:15:20,450 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 01:15:20,451 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:15:20,455 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2060 transitions. [2018-06-27 01:15:20,455 INFO ]: Start accepts. Automaton has 7 states and 2060 transitions. Word has length 5 [2018-06-27 01:15:20,455 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:20,455 INFO ]: Abstraction has 7 states and 2060 transitions. [2018-06-27 01:15:20,455 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:20,455 INFO ]: Start isEmpty. Operand 7 states and 2060 transitions. [2018-06-27 01:15:20,456 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:15:20,456 INFO ]: Found error trace [2018-06-27 01:15:20,456 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:15:20,456 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:20,457 INFO ]: Analyzing trace with hash 579741044, now seen corresponding path program 1 times [2018-06-27 01:15:20,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:20,458 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:20,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:20,459 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:20,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:20,512 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:20,591 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:20,591 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:20,591 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:20,591 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:20,591 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:20,591 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:20,591 INFO ]: Start difference. First operand 7 states and 2060 transitions. Second operand 3 states. [2018-06-27 01:15:22,378 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:22,378 INFO ]: Finished difference Result 8 states and 2060 transitions. [2018-06-27 01:15:22,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:22,378 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:15:22,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:22,379 INFO ]: With dead ends: 8 [2018-06-27 01:15:22,379 INFO ]: Without dead ends: 7 [2018-06-27 01:15:22,380 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:22,380 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:15:22,388 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:15:22,388 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:15:22,390 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1036 transitions. [2018-06-27 01:15:22,390 INFO ]: Start accepts. Automaton has 7 states and 1036 transitions. Word has length 6 [2018-06-27 01:15:22,390 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:22,390 INFO ]: Abstraction has 7 states and 1036 transitions. [2018-06-27 01:15:22,390 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:22,390 INFO ]: Start isEmpty. Operand 7 states and 1036 transitions. [2018-06-27 01:15:22,391 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:15:22,391 INFO ]: Found error trace [2018-06-27 01:15:22,391 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:15:22,391 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:22,391 INFO ]: Analyzing trace with hash 583435128, now seen corresponding path program 1 times [2018-06-27 01:15:22,391 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:22,391 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:22,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:22,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:22,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:22,428 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:22,502 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:22,503 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:22,503 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:22,503 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:22,503 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:22,503 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:22,503 INFO ]: Start difference. First operand 7 states and 1036 transitions. Second operand 3 states. [2018-06-27 01:15:23,324 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:23,324 INFO ]: Finished difference Result 8 states and 1036 transitions. [2018-06-27 01:15:23,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:23,342 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:15:23,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:23,343 INFO ]: With dead ends: 8 [2018-06-27 01:15:23,343 INFO ]: Without dead ends: 7 [2018-06-27 01:15:23,344 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:23,344 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:15:23,347 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:15:23,348 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:15:23,349 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 780 transitions. [2018-06-27 01:15:23,349 INFO ]: Start accepts. Automaton has 7 states and 780 transitions. Word has length 6 [2018-06-27 01:15:23,349 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:23,349 INFO ]: Abstraction has 7 states and 780 transitions. [2018-06-27 01:15:23,349 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:23,349 INFO ]: Start isEmpty. Operand 7 states and 780 transitions. [2018-06-27 01:15:23,350 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:15:23,350 INFO ]: Found error trace [2018-06-27 01:15:23,350 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:15:23,350 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:23,350 INFO ]: Analyzing trace with hash -365944460, now seen corresponding path program 1 times [2018-06-27 01:15:23,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:23,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:23,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:23,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:23,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:23,371 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:23,438 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:23,439 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:23,439 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:23,439 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:23,439 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:23,439 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:23,439 INFO ]: Start difference. First operand 7 states and 780 transitions. Second operand 3 states. [2018-06-27 01:15:24,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:24,049 INFO ]: Finished difference Result 8 states and 780 transitions. [2018-06-27 01:15:24,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:24,051 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:15:24,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:24,051 INFO ]: With dead ends: 8 [2018-06-27 01:15:24,051 INFO ]: Without dead ends: 7 [2018-06-27 01:15:24,051 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:24,051 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:15:24,053 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:15:24,053 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:15:24,054 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 524 transitions. [2018-06-27 01:15:24,055 INFO ]: Start accepts. Automaton has 7 states and 524 transitions. Word has length 6 [2018-06-27 01:15:24,055 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:24,055 INFO ]: Abstraction has 7 states and 524 transitions. [2018-06-27 01:15:24,055 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:24,055 INFO ]: Start isEmpty. Operand 7 states and 524 transitions. [2018-06-27 01:15:24,055 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:15:24,055 INFO ]: Found error trace [2018-06-27 01:15:24,055 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:15:24,055 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:24,055 INFO ]: Analyzing trace with hash 586205691, now seen corresponding path program 1 times [2018-06-27 01:15:24,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:24,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:24,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:24,057 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:24,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:24,083 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:24,182 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:24,182 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:24,182 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:24,182 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:24,182 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:24,182 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:24,182 INFO ]: Start difference. First operand 7 states and 524 transitions. Second operand 3 states. [2018-06-27 01:15:24,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:24,592 INFO ]: Finished difference Result 8 states and 524 transitions. [2018-06-27 01:15:24,593 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:24,593 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:15:24,593 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:24,594 INFO ]: With dead ends: 8 [2018-06-27 01:15:24,594 INFO ]: Without dead ends: 7 [2018-06-27 01:15:24,594 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:24,594 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:15:24,595 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:15:24,595 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:15:24,596 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2018-06-27 01:15:24,596 INFO ]: Start accepts. Automaton has 7 states and 268 transitions. Word has length 6 [2018-06-27 01:15:24,596 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:24,596 INFO ]: Abstraction has 7 states and 268 transitions. [2018-06-27 01:15:24,596 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:24,596 INFO ]: Start isEmpty. Operand 7 states and 268 transitions. [2018-06-27 01:15:24,596 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:15:24,596 INFO ]: Found error trace [2018-06-27 01:15:24,597 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:15:24,597 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:24,599 INFO ]: Analyzing trace with hash 106898292, now seen corresponding path program 1 times [2018-06-27 01:15:24,599 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:24,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:24,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:24,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:24,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:24,613 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:24,689 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:24,690 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:24,690 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:24,690 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:24,690 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:24,690 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:24,690 INFO ]: Start difference. First operand 7 states and 268 transitions. Second operand 3 states. [2018-06-27 01:15:24,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:24,918 INFO ]: Finished difference Result 8 states and 268 transitions. [2018-06-27 01:15:24,918 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:24,918 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:15:24,918 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:24,918 INFO ]: With dead ends: 8 [2018-06-27 01:15:24,918 INFO ]: Without dead ends: 7 [2018-06-27 01:15:24,918 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:24,918 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:15:24,919 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:15:24,920 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:15:24,920 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2018-06-27 01:15:24,920 INFO ]: Start accepts. Automaton has 7 states and 140 transitions. Word has length 6 [2018-06-27 01:15:24,920 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:24,920 INFO ]: Abstraction has 7 states and 140 transitions. [2018-06-27 01:15:24,920 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:24,920 INFO ]: Start isEmpty. Operand 7 states and 140 transitions. [2018-06-27 01:15:24,920 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:15:24,920 INFO ]: Found error trace [2018-06-27 01:15:24,920 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:15:24,920 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:24,921 INFO ]: Analyzing trace with hash -129523084, now seen corresponding path program 1 times [2018-06-27 01:15:24,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:24,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:24,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:24,921 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:24,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:24,933 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:24,994 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:24,994 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:24,994 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:24,994 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:24,994 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:24,994 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:24,994 INFO ]: Start difference. First operand 7 states and 140 transitions. Second operand 3 states. [2018-06-27 01:15:25,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:25,104 INFO ]: Finished difference Result 8 states and 140 transitions. [2018-06-27 01:15:25,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:25,104 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:15:25,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:25,104 INFO ]: With dead ends: 8 [2018-06-27 01:15:25,104 INFO ]: Without dead ends: 7 [2018-06-27 01:15:25,104 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:25,104 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:15:25,105 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:15:25,105 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:15:25,105 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2018-06-27 01:15:25,105 INFO ]: Start accepts. Automaton has 7 states and 108 transitions. Word has length 6 [2018-06-27 01:15:25,105 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:25,105 INFO ]: Abstraction has 7 states and 108 transitions. [2018-06-27 01:15:25,105 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:25,105 INFO ]: Start isEmpty. Operand 7 states and 108 transitions. [2018-06-27 01:15:25,106 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:15:25,106 INFO ]: Found error trace [2018-06-27 01:15:25,106 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:15:25,106 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:25,106 INFO ]: Analyzing trace with hash -601442315, now seen corresponding path program 1 times [2018-06-27 01:15:25,106 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:25,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:25,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:25,106 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:25,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:25,120 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:25,239 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:25,239 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:25,239 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:25,239 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:25,239 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:25,239 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:25,239 INFO ]: Start difference. First operand 7 states and 108 transitions. Second operand 3 states. [2018-06-27 01:15:25,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:25,870 INFO ]: Finished difference Result 8 states and 108 transitions. [2018-06-27 01:15:25,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:25,870 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:15:25,870 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:25,871 INFO ]: With dead ends: 8 [2018-06-27 01:15:25,871 INFO ]: Without dead ends: 7 [2018-06-27 01:15:25,871 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:25,871 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:15:25,872 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:15:25,872 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:15:25,872 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2018-06-27 01:15:25,872 INFO ]: Start accepts. Automaton has 7 states and 76 transitions. Word has length 6 [2018-06-27 01:15:25,872 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:25,872 INFO ]: Abstraction has 7 states and 76 transitions. [2018-06-27 01:15:25,872 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:25,872 INFO ]: Start isEmpty. Operand 7 states and 76 transitions. [2018-06-27 01:15:25,872 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:15:25,872 INFO ]: Found error trace [2018-06-27 01:15:25,872 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:15:25,872 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:25,873 INFO ]: Analyzing trace with hash -1071514504, now seen corresponding path program 1 times [2018-06-27 01:15:25,873 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:25,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:25,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:25,873 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:25,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:25,888 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:25,919 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:25,920 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:15:25,920 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:15:25,927 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:25,992 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:26,068 INFO ]: Computing forward predicates... [2018-06-27 01:15:26,217 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:26,239 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:15:26,240 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-27 01:15:26,240 INFO ]: Interpolant automaton has 4 states [2018-06-27 01:15:26,240 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-27 01:15:26,240 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-27 01:15:26,240 INFO ]: Start difference. First operand 7 states and 76 transitions. Second operand 4 states. [2018-06-27 01:15:26,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:26,881 INFO ]: Finished difference Result 9 states and 77 transitions. [2018-06-27 01:15:26,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 01:15:26,881 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-27 01:15:26,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:26,881 INFO ]: With dead ends: 9 [2018-06-27 01:15:26,881 INFO ]: Without dead ends: 8 [2018-06-27 01:15:26,881 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-27 01:15:26,881 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 01:15:26,882 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 01:15:26,882 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:15:26,883 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2018-06-27 01:15:26,883 INFO ]: Start accepts. Automaton has 8 states and 45 transitions. Word has length 6 [2018-06-27 01:15:26,883 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:26,883 INFO ]: Abstraction has 8 states and 45 transitions. [2018-06-27 01:15:26,883 INFO ]: Interpolant automaton has 4 states. [2018-06-27 01:15:26,883 INFO ]: Start isEmpty. Operand 8 states and 45 transitions. [2018-06-27 01:15:26,883 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:15:26,883 INFO ]: Found error trace [2018-06-27 01:15:26,883 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:15:26,883 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:26,883 INFO ]: Analyzing trace with hash -212932455, now seen corresponding path program 1 times [2018-06-27 01:15:26,883 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:26,883 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:26,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:26,884 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:26,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:26,912 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:27,035 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-27 01:15:27,035 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:27,035 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:27,035 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:27,035 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:27,035 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:27,035 INFO ]: Start difference. First operand 8 states and 45 transitions. Second operand 3 states. [2018-06-27 01:15:27,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:27,075 INFO ]: Finished difference Result 9 states and 45 transitions. [2018-06-27 01:15:27,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:27,076 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-27 01:15:27,076 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:27,076 INFO ]: With dead ends: 9 [2018-06-27 01:15:27,076 INFO ]: Without dead ends: 8 [2018-06-27 01:15:27,076 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:27,076 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 01:15:27,077 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 01:15:27,077 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:15:27,077 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-06-27 01:15:27,077 INFO ]: Start accepts. Automaton has 8 states and 29 transitions. Word has length 7 [2018-06-27 01:15:27,078 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:27,078 INFO ]: Abstraction has 8 states and 29 transitions. [2018-06-27 01:15:27,078 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:27,078 INFO ]: Start isEmpty. Operand 8 states and 29 transitions. [2018-06-27 01:15:27,078 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:15:27,078 INFO ]: Found error trace [2018-06-27 01:15:27,078 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:15:27,078 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:27,078 INFO ]: Analyzing trace with hash 1908597949, now seen corresponding path program 1 times [2018-06-27 01:15:27,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:27,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:27,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:27,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:27,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:27,094 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:27,214 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-27 01:15:27,214 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:27,214 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:27,215 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:27,215 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:27,215 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:27,215 INFO ]: Start difference. First operand 8 states and 29 transitions. Second operand 3 states. [2018-06-27 01:15:27,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:27,237 INFO ]: Finished difference Result 9 states and 29 transitions. [2018-06-27 01:15:27,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:27,237 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-27 01:15:27,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:27,238 INFO ]: With dead ends: 9 [2018-06-27 01:15:27,238 INFO ]: Without dead ends: 8 [2018-06-27 01:15:27,238 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:27,238 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 01:15:27,239 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 01:15:27,239 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:15:27,239 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-06-27 01:15:27,239 INFO ]: Start accepts. Automaton has 8 states and 21 transitions. Word has length 7 [2018-06-27 01:15:27,239 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:27,239 INFO ]: Abstraction has 8 states and 21 transitions. [2018-06-27 01:15:27,239 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:27,239 INFO ]: Start isEmpty. Operand 8 states and 21 transitions. [2018-06-27 01:15:27,240 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:15:27,240 INFO ]: Found error trace [2018-06-27 01:15:27,240 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:15:27,240 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:27,240 INFO ]: Analyzing trace with hash 2105434130, now seen corresponding path program 1 times [2018-06-27 01:15:27,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:27,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:27,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:27,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:27,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:27,253 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:27,339 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-27 01:15:27,339 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:27,340 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:27,340 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:27,340 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:27,340 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:27,340 INFO ]: Start difference. First operand 8 states and 21 transitions. Second operand 3 states. [2018-06-27 01:15:27,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:27,356 INFO ]: Finished difference Result 9 states and 21 transitions. [2018-06-27 01:15:27,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:15:27,356 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-27 01:15:27,356 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:27,356 INFO ]: With dead ends: 9 [2018-06-27 01:15:27,356 INFO ]: Without dead ends: 8 [2018-06-27 01:15:27,356 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:27,356 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 01:15:27,357 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 01:15:27,357 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:15:27,357 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-06-27 01:15:27,357 INFO ]: Start accepts. Automaton has 8 states and 17 transitions. Word has length 7 [2018-06-27 01:15:27,358 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:27,358 INFO ]: Abstraction has 8 states and 17 transitions. [2018-06-27 01:15:27,358 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:15:27,358 INFO ]: Start isEmpty. Operand 8 states and 17 transitions. [2018-06-27 01:15:27,358 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:15:27,358 INFO ]: Found error trace [2018-06-27 01:15:27,358 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:15:27,358 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:27,358 INFO ]: Analyzing trace with hash -527258470, now seen corresponding path program 1 times [2018-06-27 01:15:27,358 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:27,358 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:27,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:27,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:27,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:27,377 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:27,574 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-27 01:15:27,894 WARN ]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-27 01:15:28,035 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:28,035 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:15:28,035 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:15:28,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:28,109 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:28,112 INFO ]: Computing forward predicates... [2018-06-27 01:15:28,603 WARN ]: Spent 131.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-06-27 01:15:28,965 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:28,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:15:28,984 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-27 01:15:28,984 INFO ]: Interpolant automaton has 6 states [2018-06-27 01:15:28,985 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 01:15:28,985 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-27 01:15:28,985 INFO ]: Start difference. First operand 8 states and 17 transitions. Second operand 6 states. [2018-06-27 01:15:29,481 WARN ]: Spent 467.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2018-06-27 01:15:29,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:29,537 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-27 01:15:29,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 01:15:29,538 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-27 01:15:29,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:29,538 INFO ]: With dead ends: 10 [2018-06-27 01:15:29,538 INFO ]: Without dead ends: 8 [2018-06-27 01:15:29,538 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-27 01:15:29,538 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 01:15:29,539 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 01:15:29,539 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:15:29,539 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-06-27 01:15:29,539 INFO ]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 7 [2018-06-27 01:15:29,539 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:29,539 INFO ]: Abstraction has 8 states and 16 transitions. [2018-06-27 01:15:29,539 INFO ]: Interpolant automaton has 6 states. [2018-06-27 01:15:29,539 INFO ]: Start isEmpty. Operand 8 states and 16 transitions. [2018-06-27 01:15:29,539 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:15:29,539 INFO ]: Found error trace [2018-06-27 01:15:29,539 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:15:29,540 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:29,540 INFO ]: Analyzing trace with hash 1789918823, now seen corresponding path program 1 times [2018-06-27 01:15:29,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:29,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:29,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:29,540 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:29,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:29,561 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:29,807 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:29,807 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:15:29,807 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:15:29,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:29,871 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:29,873 INFO ]: Computing forward predicates... [2018-06-27 01:15:30,183 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:30,202 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:15:30,202 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 01:15:30,202 INFO ]: Interpolant automaton has 8 states [2018-06-27 01:15:30,202 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 01:15:30,202 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-27 01:15:30,202 INFO ]: Start difference. First operand 8 states and 16 transitions. Second operand 8 states. [2018-06-27 01:15:30,278 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:30,278 INFO ]: Finished difference Result 10 states and 17 transitions. [2018-06-27 01:15:30,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 01:15:30,279 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 01:15:30,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:30,279 INFO ]: With dead ends: 10 [2018-06-27 01:15:30,279 INFO ]: Without dead ends: 8 [2018-06-27 01:15:30,279 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-27 01:15:30,279 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 01:15:30,280 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 01:15:30,280 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:15:30,280 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-06-27 01:15:30,280 INFO ]: Start accepts. Automaton has 8 states and 15 transitions. Word has length 7 [2018-06-27 01:15:30,280 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:30,280 INFO ]: Abstraction has 8 states and 15 transitions. [2018-06-27 01:15:30,280 INFO ]: Interpolant automaton has 8 states. [2018-06-27 01:15:30,280 INFO ]: Start isEmpty. Operand 8 states and 15 transitions. [2018-06-27 01:15:30,280 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:15:30,280 INFO ]: Found error trace [2018-06-27 01:15:30,280 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:15:30,281 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:30,281 INFO ]: Analyzing trace with hash -1843010124, now seen corresponding path program 1 times [2018-06-27 01:15:30,281 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:30,281 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:30,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:30,281 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:30,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:30,299 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:30,566 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-06-27 01:15:30,597 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:30,597 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:15:30,597 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-27 01:15:30,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:30,640 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:30,642 INFO ]: Computing forward predicates... [2018-06-27 01:15:30,834 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:30,854 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:15:30,854 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 01:15:30,854 INFO ]: Interpolant automaton has 8 states [2018-06-27 01:15:30,854 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 01:15:30,854 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-27 01:15:30,854 INFO ]: Start difference. First operand 8 states and 15 transitions. Second operand 8 states. [2018-06-27 01:15:30,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:30,957 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-27 01:15:30,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 01:15:30,957 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 01:15:30,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:30,957 INFO ]: With dead ends: 10 [2018-06-27 01:15:30,957 INFO ]: Without dead ends: 8 [2018-06-27 01:15:30,957 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-27 01:15:30,958 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 01:15:30,958 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 01:15:30,958 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:15:30,959 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-27 01:15:30,959 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 7 [2018-06-27 01:15:30,959 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:30,959 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-27 01:15:30,959 INFO ]: Interpolant automaton has 8 states. [2018-06-27 01:15:30,959 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-27 01:15:30,959 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:15:30,959 INFO ]: Found error trace [2018-06-27 01:15:30,959 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:15:30,959 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:30,959 INFO ]: Analyzing trace with hash -527853116, now seen corresponding path program 1 times [2018-06-27 01:15:30,959 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:30,959 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:30,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:30,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:30,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:30,972 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:31,107 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:31,107 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:15:31,107 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:15:31,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:31,156 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:31,158 INFO ]: Computing forward predicates... [2018-06-27 01:15:31,376 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:31,395 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:15:31,395 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 01:15:31,395 INFO ]: Interpolant automaton has 8 states [2018-06-27 01:15:31,396 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 01:15:31,396 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-27 01:15:31,396 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 8 states. [2018-06-27 01:15:31,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:15:31,439 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-27 01:15:31,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-27 01:15:31,439 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 01:15:31,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:15:31,440 INFO ]: With dead ends: 4 [2018-06-27 01:15:31,440 INFO ]: Without dead ends: 0 [2018-06-27 01:15:31,440 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-27 01:15:31,440 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-27 01:15:31,440 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-27 01:15:31,440 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-27 01:15:31,440 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-27 01:15:31,440 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-27 01:15:31,440 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:15:31,440 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-27 01:15:31,440 INFO ]: Interpolant automaton has 8 states. [2018-06-27 01:15:31,440 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-27 01:15:31,440 INFO ]: Finished isEmpty. No accepting run. [2018-06-27 01:15:31,442 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-27 01:15:31,443 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 01:15:31 BasicIcfg [2018-06-27 01:15:31,444 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-27 01:15:31,444 INFO ]: Toolchain (without parser) took 39161.53 ms. Allocated memory was 309.3 MB in the beginning and 1.2 GB in the end (delta: 914.9 MB). Free memory was 261.6 MB in the beginning and 633.3 MB in the end (delta: -371.7 MB). Peak memory consumption was 543.2 MB. Max. memory is 3.6 GB. [2018-06-27 01:15:31,445 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 01:15:31,445 INFO ]: ChcToBoogie took 60.43 ms. Allocated memory is still 309.3 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-27 01:15:31,445 INFO ]: Boogie Preprocessor took 54.12 ms. Allocated memory is still 309.3 MB. Free memory was 258.6 MB in the beginning and 257.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-27 01:15:31,446 INFO ]: RCFGBuilder took 303.88 ms. Allocated memory is still 309.3 MB. Free memory was 257.5 MB in the beginning and 243.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-27 01:15:31,446 INFO ]: BlockEncodingV2 took 17137.25 ms. Allocated memory was 309.3 MB in the beginning and 869.8 MB in the end (delta: 560.5 MB). Free memory was 243.5 MB in the beginning and 699.8 MB in the end (delta: -456.3 MB). Peak memory consumption was 513.0 MB. Max. memory is 3.6 GB. [2018-06-27 01:15:31,447 INFO ]: TraceAbstraction took 21595.42 ms. Allocated memory was 869.8 MB in the beginning and 1.2 GB in the end (delta: 354.4 MB). Free memory was 699.8 MB in the beginning and 633.3 MB in the end (delta: 66.4 MB). Peak memory consumption was 420.8 MB. Max. memory is 3.6 GB. [2018-06-27 01:15:31,449 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, 2059 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.43 ms. Allocated memory is still 309.3 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 54.12 ms. Allocated memory is still 309.3 MB. Free memory was 258.6 MB in the beginning and 257.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 303.88 ms. Allocated memory is still 309.3 MB. Free memory was 257.5 MB in the beginning and 243.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 17137.25 ms. Allocated memory was 309.3 MB in the beginning and 869.8 MB in the end (delta: 560.5 MB). Free memory was 243.5 MB in the beginning and 699.8 MB in the end (delta: -456.3 MB). Peak memory consumption was 513.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 21595.42 ms. Allocated memory was 869.8 MB in the beginning and 1.2 GB in the end (delta: 354.4 MB). Free memory was 699.8 MB in the beginning and 633.3 MB in the end (delta: 66.4 MB). Peak memory consumption was 420.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 21.5s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 16.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11284 SDtfs, 4 SDslu, 99 SDs, 0 SdLazy, 5252 SolverSat, 6233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=2, 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, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 1789 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1289 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 16/42 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/hysteresis_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-27_01-15-31-460.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/hysteresis_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-27_01-15-31-460.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/hysteresis_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-27_01-15-31-460.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/hysteresis_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-27_01-15-31-460.csv Received shutdown request...