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-14921ce [2018-06-25 04:55:08,714 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 04:55:08,716 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 04:55:08,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 04:55:08,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 04:55:08,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 04:55:08,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 04:55:08,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 04:55:08,751 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 04:55:08,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 04:55:08,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 04:55:08,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 04:55:08,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 04:55:08,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 04:55:08,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 04:55:08,761 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 04:55:08,763 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 04:55:08,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 04:55:08,778 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 04:55:08,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 04:55:08,780 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 04:55:08,785 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 04:55:08,785 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 04:55:08,785 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 04:55:08,786 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 04:55:08,787 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 04:55:08,787 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 04:55:08,788 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 04:55:08,794 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 04:55:08,794 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 04:55:08,795 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 04:55:08,795 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 04:55:08,795 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 04:55:08,796 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 04:55:08,798 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 04:55:08,798 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 04:55:08,849 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 04:55:08,849 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 04:55:08,849 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 04:55:08,850 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 04:55:08,852 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 04:55:08,853 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 04:55:08,853 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 04:55:08,853 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 04:55:08,853 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 04:55:08,854 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 04:55:08,854 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 04:55:08,854 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 04:55:08,854 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 04:55:08,854 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 04:55:08,854 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 04:55:08,855 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 04:55:08,855 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 04:55:08,855 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 04:55:08,855 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 04:55:08,855 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 04:55:08,856 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 04:55:08,858 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 04:55:08,858 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 04:55:08,925 INFO ]: Repository-Root is: /tmp [2018-06-25 04:55:08,988 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 04:55:08,996 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 04:55:08,998 INFO ]: Initializing SmtParser... [2018-06-25 04:55:08,998 INFO ]: SmtParser initialized [2018-06-25 04:55:08,999 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_2.smt2 [2018-06-25 04:55:09,001 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 04:55:09,619 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_2.smt2 unknown [2018-06-25 04:55:10,315 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_2.smt2 [2018-06-25 04:55:10,321 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 04:55:10,336 INFO ]: Walking toolchain with 5 elements. [2018-06-25 04:55:10,344 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 04:55:10,344 INFO ]: Initializing ChcToBoogie... [2018-06-25 04:55:10,344 INFO ]: ChcToBoogie initialized [2018-06-25 04:55:10,412 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 04:55:10" (1/1) ... [2018-06-25 04:55:10,583 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:55:10 Unit [2018-06-25 04:55:10,583 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 04:55:10,585 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 04:55:10,585 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 04:55:10,585 INFO ]: Boogie Preprocessor initialized [2018-06-25 04:55:10,622 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:55:10" (1/1) ... [2018-06-25 04:55:10,622 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:55:10" (1/1) ... [2018-06-25 04:55:10,627 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:55:10" (1/1) ... [2018-06-25 04:55:10,628 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:55:10" (1/1) ... [2018-06-25 04:55:10,631 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:55:10" (1/1) ... [2018-06-25 04:55:10,633 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:55:10" (1/1) ... [2018-06-25 04:55:10,634 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:55:10" (1/1) ... [2018-06-25 04:55:10,638 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 04:55:10,638 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 04:55:10,638 INFO ]: Initializing RCFGBuilder... [2018-06-25 04:55:10,638 INFO ]: RCFGBuilder initialized [2018-06-25 04:55:10,646 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:55:10" (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-25 04:55:10,664 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 04:55:10,664 INFO ]: Found specification of procedure gotoProc [2018-06-25 04:55:10,665 INFO ]: Found implementation of procedure gotoProc [2018-06-25 04:55:10,665 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 04:55:10,665 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 04:55:10,665 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 04:55:10,970 INFO ]: Using library mode [2018-06-25 04:55:10,971 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 04:55:10 BoogieIcfgContainer [2018-06-25 04:55:10,971 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 04:55:10,972 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 04:55:10,972 INFO ]: Initializing BlockEncodingV2... [2018-06-25 04:55:10,977 INFO ]: BlockEncodingV2 initialized [2018-06-25 04:55:10,978 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 04:55:10" (1/1) ... [2018-06-25 04:55:10,997 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 04:55:10,999 INFO ]: Using Remove infeasible edges [2018-06-25 04:55:10,999 INFO ]: Using Maximize final states [2018-06-25 04:55:11,000 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 04:55:11,000 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 04:55:11,007 INFO ]: Using Remove sink states [2018-06-25 04:55:11,008 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 04:55:11,008 INFO ]: Using Use SBE [2018-06-25 04:55:11,016 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 04:55:13,418 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 04:55:13,622 WARN ]: Simplifying disjunction of 10752 conjuctions. This might take some time... [2018-06-25 04:55:25,867 INFO ]: Simplified to disjunction of 10752 conjuctions. [2018-06-25 04:55:25,979 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 04:55:26,207 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 04:55:26,210 INFO ]: SBE split 2 edges [2018-06-25 04:55:26,243 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 04:55:26,248 INFO ]: 0 new accepting states [2018-06-25 04:55:39,726 INFO ]: Removed 2101 edges and 2 locations by large block encoding [2018-06-25 04:55:39,728 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 04:55:39,753 INFO ]: Removed 44 edges and 0 locations because of local infeasibility [2018-06-25 04:55:39,754 INFO ]: 0 new accepting states [2018-06-25 04:55:39,756 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 04:55:39,756 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 04:55:39,762 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 04:55:39,763 INFO ]: 0 new accepting states [2018-06-25 04:55:39,765 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 04:55:39,765 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 04:55:39,777 INFO ]: Encoded RCFG 6 locations, 2059 edges [2018-06-25 04:55:39,777 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 04:55:39 BasicIcfg [2018-06-25 04:55:39,777 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 04:55:39,778 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 04:55:39,778 INFO ]: Initializing TraceAbstraction... [2018-06-25 04:55:40,031 INFO ]: TraceAbstraction initialized [2018-06-25 04:55:40,032 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 04:55:10" (1/4) ... [2018-06-25 04:55:40,033 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38370edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 04:55:40, skipping insertion in model container [2018-06-25 04:55:40,033 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:55:10" (2/4) ... [2018-06-25 04:55:40,034 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38370edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 04:55:40, skipping insertion in model container [2018-06-25 04:55:40,034 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 04:55:10" (3/4) ... [2018-06-25 04:55:40,034 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38370edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 04:55:40, skipping insertion in model container [2018-06-25 04:55:40,034 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 04:55:39" (4/4) ... [2018-06-25 04:55:40,036 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 04:55:40,221 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 04:55:40,245 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 04:55:40,897 INFO ]: Using default assertion order modulation [2018-06-25 04:55:40,898 INFO ]: Interprodecural is true [2018-06-25 04:55:40,898 INFO ]: Hoare is false [2018-06-25 04:55:40,898 INFO ]: Compute interpolants for FPandBP [2018-06-25 04:55:40,898 INFO ]: Backedges is TWOTRACK [2018-06-25 04:55:40,898 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 04:55:40,898 INFO ]: Difference is false [2018-06-25 04:55:40,898 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 04:55:40,898 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 04:55:40,939 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 04:55:40,976 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 04:55:40,976 INFO ]: Found error trace [2018-06-25 04:55:41,001 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 04:55:41,002 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:41,005 INFO ]: Analyzing trace with hash 161133075, now seen corresponding path program 1 times [2018-06-25 04:55:41,007 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:41,007 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:41,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:41,077 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:41,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:41,178 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:41,268 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:41,337 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:55:41,338 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:55:41,339 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:55:41,386 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:55:41,386 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:41,415 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 04:55:44,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:44,812 INFO ]: Finished difference Result 7 states and 2060 transitions. [2018-06-25 04:55:44,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:55:44,907 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 04:55:44,907 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:45,020 INFO ]: With dead ends: 7 [2018-06-25 04:55:45,020 INFO ]: Without dead ends: 7 [2018-06-25 04:55:45,022 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 04:55:45,082 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:55:45,259 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:55:45,274 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:55:45,278 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2060 transitions. [2018-06-25 04:55:45,280 INFO ]: Start accepts. Automaton has 7 states and 2060 transitions. Word has length 5 [2018-06-25 04:55:45,281 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:45,281 INFO ]: Abstraction has 7 states and 2060 transitions. [2018-06-25 04:55:45,281 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:55:45,281 INFO ]: Start isEmpty. Operand 7 states and 2060 transitions. [2018-06-25 04:55:45,282 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:55:45,282 INFO ]: Found error trace [2018-06-25 04:55:45,283 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:55:45,283 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:45,283 INFO ]: Analyzing trace with hash 579757381, now seen corresponding path program 1 times [2018-06-25 04:55:45,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:45,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:45,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:45,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:45,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:45,347 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:45,446 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:45,446 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:55:45,446 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:55:45,448 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:55:45,448 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:55:45,448 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:45,448 INFO ]: Start difference. First operand 7 states and 2060 transitions. Second operand 3 states. [2018-06-25 04:55:49,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:49,105 INFO ]: Finished difference Result 8 states and 2060 transitions. [2018-06-25 04:55:49,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:55:49,105 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:55:49,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:49,107 INFO ]: With dead ends: 8 [2018-06-25 04:55:49,107 INFO ]: Without dead ends: 7 [2018-06-25 04:55:49,108 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 04:55:49,108 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:55:49,119 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:55:49,119 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:55:49,123 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1548 transitions. [2018-06-25 04:55:49,123 INFO ]: Start accepts. Automaton has 7 states and 1548 transitions. Word has length 6 [2018-06-25 04:55:49,123 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:49,123 INFO ]: Abstraction has 7 states and 1548 transitions. [2018-06-25 04:55:49,123 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:55:49,123 INFO ]: Start isEmpty. Operand 7 states and 1548 transitions. [2018-06-25 04:55:49,124 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:55:49,124 INFO ]: Found error trace [2018-06-25 04:55:49,124 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:55:49,124 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:49,125 INFO ]: Analyzing trace with hash 580680902, now seen corresponding path program 1 times [2018-06-25 04:55:49,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:49,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:49,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:49,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:49,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:49,169 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:49,201 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:49,201 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:55:49,201 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:55:49,201 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:55:49,201 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:55:49,201 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:49,201 INFO ]: Start difference. First operand 7 states and 1548 transitions. Second operand 3 states. [2018-06-25 04:55:51,084 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:51,084 INFO ]: Finished difference Result 8 states and 1548 transitions. [2018-06-25 04:55:51,084 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:55:51,084 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:55:51,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:51,085 INFO ]: With dead ends: 8 [2018-06-25 04:55:51,086 INFO ]: Without dead ends: 7 [2018-06-25 04:55:51,086 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 04:55:51,086 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:55:51,091 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:55:51,091 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:55:51,093 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 780 transitions. [2018-06-25 04:55:51,093 INFO ]: Start accepts. Automaton has 7 states and 780 transitions. Word has length 6 [2018-06-25 04:55:51,093 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:51,093 INFO ]: Abstraction has 7 states and 780 transitions. [2018-06-25 04:55:51,093 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:55:51,093 INFO ]: Start isEmpty. Operand 7 states and 780 transitions. [2018-06-25 04:55:51,094 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:55:51,094 INFO ]: Found error trace [2018-06-25 04:55:51,094 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:55:51,094 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:51,094 INFO ]: Analyzing trace with hash -365928123, now seen corresponding path program 1 times [2018-06-25 04:55:51,094 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:51,094 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:51,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:51,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:51,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:51,115 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:51,151 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:51,151 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:55:51,151 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:55:51,151 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:55:51,151 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:55:51,151 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:51,152 INFO ]: Start difference. First operand 7 states and 780 transitions. Second operand 3 states. [2018-06-25 04:55:51,859 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:51,859 INFO ]: Finished difference Result 8 states and 780 transitions. [2018-06-25 04:55:51,859 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:55:51,859 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:55:51,859 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:51,860 INFO ]: With dead ends: 8 [2018-06-25 04:55:51,860 INFO ]: Without dead ends: 7 [2018-06-25 04:55:51,860 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 04:55:51,860 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:55:51,864 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:55:51,864 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:55:51,865 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 524 transitions. [2018-06-25 04:55:51,865 INFO ]: Start accepts. Automaton has 7 states and 524 transitions. Word has length 6 [2018-06-25 04:55:51,865 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:51,865 INFO ]: Abstraction has 7 states and 524 transitions. [2018-06-25 04:55:51,865 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:55:51,865 INFO ]: Start isEmpty. Operand 7 states and 524 transitions. [2018-06-25 04:55:51,866 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:55:51,866 INFO ]: Found error trace [2018-06-25 04:55:51,866 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:55:51,866 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:51,866 INFO ]: Analyzing trace with hash -365004602, now seen corresponding path program 1 times [2018-06-25 04:55:51,866 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:51,866 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:51,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:51,867 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:51,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:51,885 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:51,940 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:51,940 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:55:51,940 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:55:51,940 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:55:51,940 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:55:51,940 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:51,940 INFO ]: Start difference. First operand 7 states and 524 transitions. Second operand 3 states. [2018-06-25 04:55:52,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:52,555 INFO ]: Finished difference Result 8 states and 524 transitions. [2018-06-25 04:55:52,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:55:52,555 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:55:52,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:52,555 INFO ]: With dead ends: 8 [2018-06-25 04:55:52,555 INFO ]: Without dead ends: 7 [2018-06-25 04:55:52,556 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 04:55:52,556 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:55:52,559 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:55:52,559 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:55:52,560 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 396 transitions. [2018-06-25 04:55:52,560 INFO ]: Start accepts. Automaton has 7 states and 396 transitions. Word has length 6 [2018-06-25 04:55:52,560 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:52,560 INFO ]: Abstraction has 7 states and 396 transitions. [2018-06-25 04:55:52,560 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:55:52,560 INFO ]: Start isEmpty. Operand 7 states and 396 transitions. [2018-06-25 04:55:52,560 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:55:52,560 INFO ]: Found error trace [2018-06-25 04:55:52,560 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:55:52,560 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:52,560 INFO ]: Analyzing trace with hash 109685192, now seen corresponding path program 1 times [2018-06-25 04:55:52,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:52,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:52,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:52,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:52,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:52,587 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:52,676 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:52,676 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:55:52,676 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:55:52,676 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:55:52,676 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:55:52,676 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:52,676 INFO ]: Start difference. First operand 7 states and 396 transitions. Second operand 3 states. [2018-06-25 04:55:53,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:53,026 INFO ]: Finished difference Result 8 states and 396 transitions. [2018-06-25 04:55:53,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:55:53,027 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:55:53,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:53,027 INFO ]: With dead ends: 8 [2018-06-25 04:55:53,027 INFO ]: Without dead ends: 7 [2018-06-25 04:55:53,028 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:53,028 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:55:53,029 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:55:53,029 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:55:53,030 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2018-06-25 04:55:53,030 INFO ]: Start accepts. Automaton has 7 states and 140 transitions. Word has length 6 [2018-06-25 04:55:53,030 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:53,030 INFO ]: Abstraction has 7 states and 140 transitions. [2018-06-25 04:55:53,030 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:55:53,030 INFO ]: Start isEmpty. Operand 7 states and 140 transitions. [2018-06-25 04:55:53,030 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:55:53,030 INFO ]: Found error trace [2018-06-25 04:55:53,030 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:55:53,030 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:53,030 INFO ]: Analyzing trace with hash -127659705, now seen corresponding path program 1 times [2018-06-25 04:55:53,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:53,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:53,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:53,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:53,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:53,061 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:53,176 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:53,176 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 04:55:53,176 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 04:55:53,196 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:53,257 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:53,285 INFO ]: Computing forward predicates... [2018-06-25 04:55:53,373 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:53,407 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 04:55:53,407 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 04:55:53,408 INFO ]: Interpolant automaton has 4 states [2018-06-25 04:55:53,408 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 04:55:53,408 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 04:55:53,408 INFO ]: Start difference. First operand 7 states and 140 transitions. Second operand 4 states. [2018-06-25 04:55:54,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:54,671 INFO ]: Finished difference Result 9 states and 141 transitions. [2018-06-25 04:55:54,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 04:55:54,671 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 04:55:54,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:54,671 INFO ]: With dead ends: 9 [2018-06-25 04:55:54,672 INFO ]: Without dead ends: 8 [2018-06-25 04:55:54,672 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 04:55:54,672 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:55:54,673 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:55:54,673 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:55:54,673 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2018-06-25 04:55:54,674 INFO ]: Start accepts. Automaton has 8 states and 109 transitions. Word has length 6 [2018-06-25 04:55:54,674 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:54,674 INFO ]: Abstraction has 8 states and 109 transitions. [2018-06-25 04:55:54,674 INFO ]: Interpolant automaton has 4 states. [2018-06-25 04:55:54,674 INFO ]: Start isEmpty. Operand 8 states and 109 transitions. [2018-06-25 04:55:54,674 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:55:54,674 INFO ]: Found error trace [2018-06-25 04:55:54,674 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:55:54,674 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:54,674 INFO ]: Analyzing trace with hash -954300814, now seen corresponding path program 1 times [2018-06-25 04:55:54,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:54,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:54,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:54,675 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:54,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:54,711 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:54,759 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 04:55:54,759 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:55:54,759 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:55:54,759 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:55:54,759 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:55:54,759 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:54,759 INFO ]: Start difference. First operand 8 states and 109 transitions. Second operand 3 states. [2018-06-25 04:55:54,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:54,893 INFO ]: Finished difference Result 9 states and 109 transitions. [2018-06-25 04:55:54,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:55:54,893 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 04:55:54,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:54,894 INFO ]: With dead ends: 9 [2018-06-25 04:55:54,894 INFO ]: Without dead ends: 8 [2018-06-25 04:55:54,894 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 04:55:54,894 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:55:54,895 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:55:54,895 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:55:54,896 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2018-06-25 04:55:54,896 INFO ]: Start accepts. Automaton has 8 states and 85 transitions. Word has length 7 [2018-06-25 04:55:54,896 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:54,896 INFO ]: Abstraction has 8 states and 85 transitions. [2018-06-25 04:55:54,896 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:55:54,896 INFO ]: Start isEmpty. Operand 8 states and 85 transitions. [2018-06-25 04:55:54,896 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:55:54,896 INFO ]: Found error trace [2018-06-25 04:55:54,896 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:55:54,896 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:54,896 INFO ]: Analyzing trace with hash 2079794546, now seen corresponding path program 1 times [2018-06-25 04:55:54,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:54,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:54,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:54,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:54,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:54,913 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:54,968 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 04:55:54,968 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:55:54,968 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:55:54,969 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:55:54,969 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:55:54,969 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:54,969 INFO ]: Start difference. First operand 8 states and 85 transitions. Second operand 3 states. [2018-06-25 04:55:55,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:55,138 INFO ]: Finished difference Result 9 states and 85 transitions. [2018-06-25 04:55:55,138 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:55:55,138 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 04:55:55,138 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:55,138 INFO ]: With dead ends: 9 [2018-06-25 04:55:55,138 INFO ]: Without dead ends: 8 [2018-06-25 04:55:55,138 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 04:55:55,138 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:55:55,140 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:55:55,140 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:55:55,140 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2018-06-25 04:55:55,140 INFO ]: Start accepts. Automaton has 8 states and 61 transitions. Word has length 7 [2018-06-25 04:55:55,140 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:55,140 INFO ]: Abstraction has 8 states and 61 transitions. [2018-06-25 04:55:55,140 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:55:55,140 INFO ]: Start isEmpty. Operand 8 states and 61 transitions. [2018-06-25 04:55:55,140 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:55:55,140 INFO ]: Found error trace [2018-06-25 04:55:55,140 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:55:55,141 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:55,141 INFO ]: Analyzing trace with hash -264822606, now seen corresponding path program 1 times [2018-06-25 04:55:55,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:55,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:55,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:55,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:55,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:55,166 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:55,290 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 04:55:55,290 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:55:55,290 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:55:55,290 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:55:55,290 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:55:55,290 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:55,290 INFO ]: Start difference. First operand 8 states and 61 transitions. Second operand 3 states. [2018-06-25 04:55:55,416 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:55,416 INFO ]: Finished difference Result 9 states and 61 transitions. [2018-06-25 04:55:55,416 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:55:55,417 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 04:55:55,417 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:55,417 INFO ]: With dead ends: 9 [2018-06-25 04:55:55,417 INFO ]: Without dead ends: 8 [2018-06-25 04:55:55,417 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:55,417 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:55:55,418 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:55:55,418 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:55:55,418 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-06-25 04:55:55,419 INFO ]: Start accepts. Automaton has 8 states and 37 transitions. Word has length 7 [2018-06-25 04:55:55,419 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:55,419 INFO ]: Abstraction has 8 states and 37 transitions. [2018-06-25 04:55:55,419 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:55:55,419 INFO ]: Start isEmpty. Operand 8 states and 37 transitions. [2018-06-25 04:55:55,419 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:55:55,419 INFO ]: Found error trace [2018-06-25 04:55:55,419 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:55:55,419 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:55,419 INFO ]: Analyzing trace with hash -1958105037, now seen corresponding path program 1 times [2018-06-25 04:55:55,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:55,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:55,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:55,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:55,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:55,443 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:55,563 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 04:55:55,563 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:55:55,563 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:55:55,563 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:55:55,563 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:55:55,563 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:55,563 INFO ]: Start difference. First operand 8 states and 37 transitions. Second operand 3 states. [2018-06-25 04:55:55,979 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:55,979 INFO ]: Finished difference Result 9 states and 37 transitions. [2018-06-25 04:55:55,979 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:55:55,979 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 04:55:55,980 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:55,980 INFO ]: With dead ends: 9 [2018-06-25 04:55:55,980 INFO ]: Without dead ends: 8 [2018-06-25 04:55:55,980 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 04:55:55,980 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:55:55,981 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:55:55,981 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:55:55,983 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-25 04:55:55,983 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 7 [2018-06-25 04:55:55,983 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:55,983 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-25 04:55:55,983 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:55:55,983 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-25 04:55:55,983 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:55:55,983 INFO ]: Found error trace [2018-06-25 04:55:55,983 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:55:55,983 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:55,983 INFO ]: Analyzing trace with hash -1273383997, now seen corresponding path program 1 times [2018-06-25 04:55:55,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:55,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:55,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:55,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:55,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:55,999 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:56,119 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 04:55:56,119 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:55:56,154 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:55:56,155 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:55:56,155 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:55:56,155 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:56,155 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 3 states. [2018-06-25 04:55:56,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:56,402 INFO ]: Finished difference Result 9 states and 25 transitions. [2018-06-25 04:55:56,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:55:56,403 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 04:55:56,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:56,403 INFO ]: With dead ends: 9 [2018-06-25 04:55:56,403 INFO ]: Without dead ends: 8 [2018-06-25 04:55:56,403 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:55:56,403 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:55:56,404 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:55:56,404 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:55:56,405 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-06-25 04:55:56,405 INFO ]: Start accepts. Automaton has 8 states and 21 transitions. Word has length 7 [2018-06-25 04:55:56,405 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:56,405 INFO ]: Abstraction has 8 states and 21 transitions. [2018-06-25 04:55:56,405 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:55:56,405 INFO ]: Start isEmpty. Operand 8 states and 21 transitions. [2018-06-25 04:55:56,405 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:55:56,405 INFO ]: Found error trace [2018-06-25 04:55:56,406 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:55:56,406 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:56,406 INFO ]: Analyzing trace with hash 1276989026, now seen corresponding path program 1 times [2018-06-25 04:55:56,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:56,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:56,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:56,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:56,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:56,432 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:56,628 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-25 04:55:56,724 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:56,724 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 04:55:56,724 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 04:55:56,730 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:56,778 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:56,780 INFO ]: Computing forward predicates... [2018-06-25 04:55:57,343 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:57,377 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 04:55:57,377 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 04:55:57,377 INFO ]: Interpolant automaton has 8 states [2018-06-25 04:55:57,377 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 04:55:57,377 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 04:55:57,377 INFO ]: Start difference. First operand 8 states and 21 transitions. Second operand 8 states. [2018-06-25 04:55:57,615 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 04:55:58,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:55:58,262 INFO ]: Finished difference Result 11 states and 23 transitions. [2018-06-25 04:55:58,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 04:55:58,263 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 04:55:58,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:55:58,263 INFO ]: With dead ends: 11 [2018-06-25 04:55:58,263 INFO ]: Without dead ends: 8 [2018-06-25 04:55:58,264 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-25 04:55:58,264 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:55:58,264 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:55:58,264 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:55:58,265 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-06-25 04:55:58,265 INFO ]: Start accepts. Automaton has 8 states and 19 transitions. Word has length 7 [2018-06-25 04:55:58,265 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:55:58,265 INFO ]: Abstraction has 8 states and 19 transitions. [2018-06-25 04:55:58,265 INFO ]: Interpolant automaton has 8 states. [2018-06-25 04:55:58,265 INFO ]: Start isEmpty. Operand 8 states and 19 transitions. [2018-06-25 04:55:58,265 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:55:58,265 INFO ]: Found error trace [2018-06-25 04:55:58,265 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:55:58,265 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:55:58,265 INFO ]: Analyzing trace with hash -240950623, now seen corresponding path program 1 times [2018-06-25 04:55:58,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:55:58,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:55:58,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:58,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:55:58,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:55:58,288 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:58,645 WARN ]: Spent 283.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 7 [2018-06-25 04:55:59,275 WARN ]: Spent 579.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2018-06-25 04:55:59,422 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:59,423 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 04:55:59,423 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) [2018-06-25 04:55:59,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 04:55:59,493 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:55:59,496 INFO ]: Computing forward predicates... [2018-06-25 04:55:59,892 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:55:59,912 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 04:55:59,912 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 04:55:59,913 INFO ]: Interpolant automaton has 8 states [2018-06-25 04:55:59,913 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 04:55:59,913 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 04:55:59,913 INFO ]: Start difference. First operand 8 states and 19 transitions. Second operand 8 states. [2018-06-25 04:56:00,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:00,033 INFO ]: Finished difference Result 11 states and 21 transitions. [2018-06-25 04:56:00,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 04:56:00,033 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 04:56:00,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:00,033 INFO ]: With dead ends: 11 [2018-06-25 04:56:00,033 INFO ]: Without dead ends: 8 [2018-06-25 04:56:00,033 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-25 04:56:00,033 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:56:00,034 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:56:00,034 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:56:00,034 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-06-25 04:56:00,035 INFO ]: Start accepts. Automaton has 8 states and 17 transitions. Word has length 7 [2018-06-25 04:56:00,035 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:00,035 INFO ]: Abstraction has 8 states and 17 transitions. [2018-06-25 04:56:00,035 INFO ]: Interpolant automaton has 8 states. [2018-06-25 04:56:00,035 INFO ]: Start isEmpty. Operand 8 states and 17 transitions. [2018-06-25 04:56:00,035 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:56:00,035 INFO ]: Found error trace [2018-06-25 04:56:00,035 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:56:00,035 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:00,035 INFO ]: Analyzing trace with hash 1962899358, now seen corresponding path program 1 times [2018-06-25 04:56:00,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:00,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:00,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:00,036 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:00,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:00,050 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:00,201 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:00,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 04:56:00,201 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 04:56:00,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:00,243 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:00,245 INFO ]: Computing forward predicates... [2018-06-25 04:56:00,486 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:00,508 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 04:56:00,508 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 04:56:00,508 INFO ]: Interpolant automaton has 8 states [2018-06-25 04:56:00,508 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 04:56:00,508 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 04:56:00,508 INFO ]: Start difference. First operand 8 states and 17 transitions. Second operand 8 states. [2018-06-25 04:56:00,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:00,629 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-25 04:56:00,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 04:56:00,629 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 04:56:00,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:00,630 INFO ]: With dead ends: 11 [2018-06-25 04:56:00,630 INFO ]: Without dead ends: 8 [2018-06-25 04:56:00,630 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-25 04:56:00,630 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:56:00,631 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:56:00,631 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:56:00,631 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-06-25 04:56:00,631 INFO ]: Start accepts. Automaton has 8 states and 15 transitions. Word has length 7 [2018-06-25 04:56:00,631 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:00,631 INFO ]: Abstraction has 8 states and 15 transitions. [2018-06-25 04:56:00,631 INFO ]: Interpolant automaton has 8 states. [2018-06-25 04:56:00,631 INFO ]: Start isEmpty. Operand 8 states and 15 transitions. [2018-06-25 04:56:00,631 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:56:00,631 INFO ]: Found error trace [2018-06-25 04:56:00,631 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:56:00,632 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:00,632 INFO ]: Analyzing trace with hash -1070006710, now seen corresponding path program 1 times [2018-06-25 04:56:00,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:00,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:00,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:00,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:00,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:00,645 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:00,777 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:00,777 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 04:56:00,777 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 04:56:00,784 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:00,824 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:00,826 INFO ]: Computing forward predicates... [2018-06-25 04:56:00,966 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:00,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 04:56:00,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 04:56:00,988 INFO ]: Interpolant automaton has 8 states [2018-06-25 04:56:00,989 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 04:56:00,989 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 04:56:00,989 INFO ]: Start difference. First operand 8 states and 15 transitions. Second operand 8 states. [2018-06-25 04:56:01,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:01,068 INFO ]: Finished difference Result 5 states and 5 transitions. [2018-06-25 04:56:01,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 04:56:01,068 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 04:56:01,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:01,068 INFO ]: With dead ends: 5 [2018-06-25 04:56:01,068 INFO ]: Without dead ends: 0 [2018-06-25 04:56:01,068 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-25 04:56:01,068 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 04:56:01,068 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 04:56:01,068 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 04:56:01,068 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 04:56:01,068 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 04:56:01,068 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:01,068 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 04:56:01,068 INFO ]: Interpolant automaton has 8 states. [2018-06-25 04:56:01,068 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 04:56:01,069 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 04:56:01,070 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 04:56:01,071 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 04:56:01 BasicIcfg [2018-06-25 04:56:01,071 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 04:56:01,073 INFO ]: Toolchain (without parser) took 50751.44 ms. Allocated memory was 235.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 188.5 MB in the beginning and 845.7 MB in the end (delta: -657.2 MB). Peak memory consumption was 633.6 MB. Max. memory is 3.6 GB. [2018-06-25 04:56:01,073 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 235.9 MB. Free memory is still 200.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 04:56:01,074 INFO ]: ChcToBoogie took 240.10 ms. Allocated memory is still 235.9 MB. Free memory was 186.5 MB in the beginning and 184.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 04:56:01,074 INFO ]: Boogie Preprocessor took 52.97 ms. Allocated memory is still 235.9 MB. Free memory is still 184.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 04:56:01,074 INFO ]: RCFGBuilder took 332.87 ms. Allocated memory is still 235.9 MB. Free memory was 184.5 MB in the beginning and 170.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 04:56:01,075 INFO ]: BlockEncodingV2 took 28805.63 ms. Allocated memory was 235.9 MB in the beginning and 767.6 MB in the end (delta: 531.6 MB). Free memory was 170.5 MB in the beginning and 158.8 MB in the end (delta: 11.8 MB). Peak memory consumption was 636.9 MB. Max. memory is 3.6 GB. [2018-06-25 04:56:01,076 INFO ]: TraceAbstraction took 21293.37 ms. Allocated memory was 767.6 MB in the beginning and 1.5 GB in the end (delta: 759.2 MB). Free memory was 158.8 MB in the beginning and 845.7 MB in the end (delta: -686.9 MB). Peak memory consumption was 72.2 MB. Max. memory is 3.6 GB. [2018-06-25 04:56:01,079 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 235.9 MB. Free memory is still 200.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 240.10 ms. Allocated memory is still 235.9 MB. Free memory was 186.5 MB in the beginning and 184.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.97 ms. Allocated memory is still 235.9 MB. Free memory is still 184.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 332.87 ms. Allocated memory is still 235.9 MB. Free memory was 184.5 MB in the beginning and 170.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 28805.63 ms. Allocated memory was 235.9 MB in the beginning and 767.6 MB in the end (delta: 531.6 MB). Free memory was 170.5 MB in the beginning and 158.8 MB in the end (delta: 11.8 MB). Peak memory consumption was 636.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 21293.37 ms. Allocated memory was 767.6 MB in the beginning and 1.5 GB in the end (delta: 759.2 MB). Free memory was 158.8 MB in the beginning and 845.7 MB in the end (delta: -686.9 MB). Peak memory consumption was 72.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 20.1s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7857 SDtfs, 0 SDslu, 99 SDs, 0 SdLazy, 3934 SolverSat, 4257 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=7, 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.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 1743 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1279 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 20/46 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-25_04-56-01-091.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-25_04-56-01-091.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-25_04-56-01-091.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-25_04-56-01-091.csv Received shutdown request...