java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i '/storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:08:18,950 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:08:18,952 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:08:18,965 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:08:18,966 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:08:18,967 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:08:18,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:08:18,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:08:18,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:08:18,977 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:08:18,978 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:08:18,978 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:08:18,979 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:08:18,980 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:08:18,983 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:08:18,984 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:08:18,986 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:08:18,988 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:08:18,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:08:18,991 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:08:18,992 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:08:19,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:08:19,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:08:19,004 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:08:19,005 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:08:19,006 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:08:19,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:08:19,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:08:19,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:08:19,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:08:19,009 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:08:19,010 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:08:19,010 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:08:19,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:08:19,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:08:19,020 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:08:19,035 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:08:19,036 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:08:19,036 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:08:19,036 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:08:19,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:08:19,038 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:08:19,038 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:08:19,038 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:08:19,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:08:19,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:08:19,038 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:08:19,039 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:08:19,039 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:08:19,039 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:08:19,039 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:08:19,039 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:08:19,040 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:08:19,041 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:08:19,041 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:08:19,077 INFO ]: Repository-Root is: /tmp [2018-06-22 02:08:19,092 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:08:19,096 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:08:19,097 INFO ]: Initializing SmtParser... [2018-06-22 02:08:19,097 INFO ]: SmtParser initialized [2018-06-22 02:08:19,098 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2 [2018-06-22 02:08:19,099 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-22 02:08:19,191 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@147c8901 [2018-06-22 02:08:19,617 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2 [2018-06-22 02:08:19,622 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:08:19,631 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:08:19,631 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:08:19,631 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:08:19,631 INFO ]: ChcToBoogie initialized [2018-06-22 02:08:19,634 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:08:19" (1/1) ... [2018-06-22 02:08:19,720 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:19 Unit [2018-06-22 02:08:19,720 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:08:19,721 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:08:19,721 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:08:19,721 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:08:19,741 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:19" (1/1) ... [2018-06-22 02:08:19,741 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:19" (1/1) ... [2018-06-22 02:08:19,749 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:19" (1/1) ... [2018-06-22 02:08:19,749 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:19" (1/1) ... [2018-06-22 02:08:19,772 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:19" (1/1) ... [2018-06-22 02:08:19,777 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:19" (1/1) ... [2018-06-22 02:08:19,780 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:19" (1/1) ... [2018-06-22 02:08:19,783 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:08:19,784 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:08:19,784 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:08:19,784 INFO ]: RCFGBuilder initialized [2018-06-22 02:08:19,785 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:19" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 02:08:19,798 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:08:19,798 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:08:19,798 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:08:19,798 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:08:19,798 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:08:19,798 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:08:20,956 INFO ]: Using library mode [2018-06-22 02:08:20,957 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:08:20 BoogieIcfgContainer [2018-06-22 02:08:20,957 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:08:20,959 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:08:20,959 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:08:20,962 INFO ]: TraceAbstraction initialized [2018-06-22 02:08:20,962 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:08:19" (1/3) ... [2018-06-22 02:08:20,963 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9270243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:08:20, skipping insertion in model container [2018-06-22 02:08:20,963 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:19" (2/3) ... [2018-06-22 02:08:20,963 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9270243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:08:20, skipping insertion in model container [2018-06-22 02:08:20,963 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:08:20" (3/3) ... [2018-06-22 02:08:20,967 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:08:20,975 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:08:20,986 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:08:21,037 INFO ]: Using default assertion order modulation [2018-06-22 02:08:21,038 INFO ]: Interprodecural is true [2018-06-22 02:08:21,038 INFO ]: Hoare is false [2018-06-22 02:08:21,038 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:08:21,038 INFO ]: Backedges is TWOTRACK [2018-06-22 02:08:21,038 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:08:21,038 INFO ]: Difference is false [2018-06-22 02:08:21,038 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:08:21,038 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:08:21,076 INFO ]: Start isEmpty. Operand 75 states. [2018-06-22 02:08:21,095 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:08:21,095 INFO ]: Found error trace [2018-06-22 02:08:21,096 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:21,096 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:21,101 INFO ]: Analyzing trace with hash -1152714571, now seen corresponding path program 1 times [2018-06-22 02:08:21,102 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:21,104 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:21,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:21,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:21,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:21,192 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:21,279 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:21,281 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:21,281 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:21,282 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:21,294 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:21,294 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:21,296 INFO ]: Start difference. First operand 75 states. Second operand 4 states. [2018-06-22 02:08:22,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:22,842 INFO ]: Finished difference Result 135 states and 277 transitions. [2018-06-22 02:08:22,843 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:22,844 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 02:08:22,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:22,874 INFO ]: With dead ends: 135 [2018-06-22 02:08:22,874 INFO ]: Without dead ends: 135 [2018-06-22 02:08:22,876 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:08:22,895 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-22 02:08:22,953 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-06-22 02:08:22,954 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 02:08:22,962 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 277 transitions. [2018-06-22 02:08:22,964 INFO ]: Start accepts. Automaton has 135 states and 277 transitions. Word has length 7 [2018-06-22 02:08:22,964 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:22,964 INFO ]: Abstraction has 135 states and 277 transitions. [2018-06-22 02:08:22,964 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:22,965 INFO ]: Start isEmpty. Operand 135 states and 277 transitions. [2018-06-22 02:08:22,971 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:08:22,971 INFO ]: Found error trace [2018-06-22 02:08:22,971 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:22,972 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:22,972 INFO ]: Analyzing trace with hash -849666023, now seen corresponding path program 1 times [2018-06-22 02:08:22,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:22,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:22,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:22,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:22,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:22,977 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:23,112 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:23,112 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:23,112 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:23,114 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:23,114 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:23,114 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:23,114 INFO ]: Start difference. First operand 135 states and 277 transitions. Second operand 4 states. [2018-06-22 02:08:24,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:24,270 INFO ]: Finished difference Result 201 states and 414 transitions. [2018-06-22 02:08:24,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:24,270 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 02:08:24,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:24,289 INFO ]: With dead ends: 201 [2018-06-22 02:08:24,289 INFO ]: Without dead ends: 201 [2018-06-22 02:08:24,290 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:08:24,290 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-22 02:08:24,330 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-06-22 02:08:24,330 INFO ]: Start removeUnreachable. Operand 201 states. [2018-06-22 02:08:24,338 INFO ]: Finished removeUnreachable. Reduced from 201 states to 201 states and 414 transitions. [2018-06-22 02:08:24,339 INFO ]: Start accepts. Automaton has 201 states and 414 transitions. Word has length 9 [2018-06-22 02:08:24,339 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:24,339 INFO ]: Abstraction has 201 states and 414 transitions. [2018-06-22 02:08:24,339 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:24,339 INFO ]: Start isEmpty. Operand 201 states and 414 transitions. [2018-06-22 02:08:24,346 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:08:24,346 INFO ]: Found error trace [2018-06-22 02:08:24,346 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:24,346 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:24,346 INFO ]: Analyzing trace with hash -906605010, now seen corresponding path program 1 times [2018-06-22 02:08:24,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:24,346 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:24,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:24,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:24,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:24,357 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:24,411 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:24,411 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:24,411 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:24,411 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:24,411 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:24,411 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:24,411 INFO ]: Start difference. First operand 201 states and 414 transitions. Second operand 4 states. [2018-06-22 02:08:25,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:25,108 INFO ]: Finished difference Result 267 states and 551 transitions. [2018-06-22 02:08:25,108 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:25,108 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 02:08:25,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:25,131 INFO ]: With dead ends: 267 [2018-06-22 02:08:25,131 INFO ]: Without dead ends: 267 [2018-06-22 02:08:25,131 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:08:25,131 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-22 02:08:25,167 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-22 02:08:25,167 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-22 02:08:25,176 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 551 transitions. [2018-06-22 02:08:25,176 INFO ]: Start accepts. Automaton has 267 states and 551 transitions. Word has length 10 [2018-06-22 02:08:25,176 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:25,176 INFO ]: Abstraction has 267 states and 551 transitions. [2018-06-22 02:08:25,176 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:25,176 INFO ]: Start isEmpty. Operand 267 states and 551 transitions. [2018-06-22 02:08:25,181 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:08:25,181 INFO ]: Found error trace [2018-06-22 02:08:25,181 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:25,181 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:25,181 INFO ]: Analyzing trace with hash -997110068, now seen corresponding path program 1 times [2018-06-22 02:08:25,181 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:25,181 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:25,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:25,182 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:25,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:25,188 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:25,258 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:25,258 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:25,258 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:25,258 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:25,258 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:25,258 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:25,258 INFO ]: Start difference. First operand 267 states and 551 transitions. Second operand 4 states. [2018-06-22 02:08:25,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:25,635 INFO ]: Finished difference Result 333 states and 688 transitions. [2018-06-22 02:08:25,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:25,636 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 02:08:25,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:25,661 INFO ]: With dead ends: 333 [2018-06-22 02:08:25,661 INFO ]: Without dead ends: 333 [2018-06-22 02:08:25,662 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:08:25,662 INFO ]: Start minimizeSevpa. Operand 333 states. [2018-06-22 02:08:25,697 INFO ]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-06-22 02:08:25,697 INFO ]: Start removeUnreachable. Operand 333 states. [2018-06-22 02:08:25,708 INFO ]: Finished removeUnreachable. Reduced from 333 states to 333 states and 688 transitions. [2018-06-22 02:08:25,708 INFO ]: Start accepts. Automaton has 333 states and 688 transitions. Word has length 10 [2018-06-22 02:08:25,709 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:25,709 INFO ]: Abstraction has 333 states and 688 transitions. [2018-06-22 02:08:25,709 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:25,709 INFO ]: Start isEmpty. Operand 333 states and 688 transitions. [2018-06-22 02:08:25,718 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:08:25,718 INFO ]: Found error trace [2018-06-22 02:08:25,718 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:25,718 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:25,718 INFO ]: Analyzing trace with hash 1735164274, now seen corresponding path program 1 times [2018-06-22 02:08:25,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:25,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:25,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:25,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:25,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:25,725 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:25,829 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:25,829 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:25,829 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:25,829 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:25,829 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:25,829 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:25,829 INFO ]: Start difference. First operand 333 states and 688 transitions. Second operand 4 states. [2018-06-22 02:08:26,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:26,096 INFO ]: Finished difference Result 399 states and 825 transitions. [2018-06-22 02:08:26,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:26,096 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-22 02:08:26,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:26,116 INFO ]: With dead ends: 399 [2018-06-22 02:08:26,116 INFO ]: Without dead ends: 399 [2018-06-22 02:08:26,116 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:08:26,116 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-22 02:08:26,164 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-22 02:08:26,164 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-22 02:08:26,178 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 825 transitions. [2018-06-22 02:08:26,178 INFO ]: Start accepts. Automaton has 399 states and 825 transitions. Word has length 12 [2018-06-22 02:08:26,178 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:26,178 INFO ]: Abstraction has 399 states and 825 transitions. [2018-06-22 02:08:26,178 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:26,178 INFO ]: Start isEmpty. Operand 399 states and 825 transitions. [2018-06-22 02:08:26,193 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:08:26,193 INFO ]: Found error trace [2018-06-22 02:08:26,193 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:26,193 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:26,194 INFO ]: Analyzing trace with hash -694566206, now seen corresponding path program 1 times [2018-06-22 02:08:26,194 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:26,194 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:26,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:26,194 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:26,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:26,211 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:26,239 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:26,239 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:26,239 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:26,239 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:26,240 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:26,240 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:26,241 INFO ]: Start difference. First operand 399 states and 825 transitions. Second operand 3 states. [2018-06-22 02:08:26,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:26,492 INFO ]: Finished difference Result 627 states and 1588 transitions. [2018-06-22 02:08:26,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:26,492 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-22 02:08:26,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:26,558 INFO ]: With dead ends: 627 [2018-06-22 02:08:26,558 INFO ]: Without dead ends: 627 [2018-06-22 02:08:26,559 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-22 02:08:26,559 INFO ]: Start minimizeSevpa. Operand 627 states. [2018-06-22 02:08:26,635 INFO ]: Finished minimizeSevpa. Reduced states from 627 to 423. [2018-06-22 02:08:26,635 INFO ]: Start removeUnreachable. Operand 423 states. [2018-06-22 02:08:26,648 INFO ]: Finished removeUnreachable. Reduced from 423 states to 423 states and 897 transitions. [2018-06-22 02:08:26,648 INFO ]: Start accepts. Automaton has 423 states and 897 transitions. Word has length 13 [2018-06-22 02:08:26,648 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:26,648 INFO ]: Abstraction has 423 states and 897 transitions. [2018-06-22 02:08:26,648 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:26,648 INFO ]: Start isEmpty. Operand 423 states and 897 transitions. [2018-06-22 02:08:26,706 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 02:08:26,706 INFO ]: Found error trace [2018-06-22 02:08:26,706 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:26,706 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:26,706 INFO ]: Analyzing trace with hash 1419205908, now seen corresponding path program 1 times [2018-06-22 02:08:26,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:26,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:26,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:26,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:26,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:26,717 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:26,864 INFO ]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:08:26,864 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:26,864 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:26,864 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:26,864 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:26,864 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:26,864 INFO ]: Start difference. First operand 423 states and 897 transitions. Second operand 3 states. [2018-06-22 02:08:27,006 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:27,006 INFO ]: Finished difference Result 741 states and 1948 transitions. [2018-06-22 02:08:27,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:27,006 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-22 02:08:27,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:27,087 INFO ]: With dead ends: 741 [2018-06-22 02:08:27,087 INFO ]: Without dead ends: 741 [2018-06-22 02:08:27,087 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-22 02:08:27,088 INFO ]: Start minimizeSevpa. Operand 741 states. [2018-06-22 02:08:27,153 INFO ]: Finished minimizeSevpa. Reduced states from 741 to 429. [2018-06-22 02:08:27,154 INFO ]: Start removeUnreachable. Operand 429 states. [2018-06-22 02:08:27,165 INFO ]: Finished removeUnreachable. Reduced from 429 states to 429 states and 945 transitions. [2018-06-22 02:08:27,165 INFO ]: Start accepts. Automaton has 429 states and 945 transitions. Word has length 22 [2018-06-22 02:08:27,165 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:27,165 INFO ]: Abstraction has 429 states and 945 transitions. [2018-06-22 02:08:27,165 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:27,165 INFO ]: Start isEmpty. Operand 429 states and 945 transitions. [2018-06-22 02:08:27,218 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:08:27,218 INFO ]: Found error trace [2018-06-22 02:08:27,218 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:27,218 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:27,218 INFO ]: Analyzing trace with hash 1204756335, now seen corresponding path program 1 times [2018-06-22 02:08:27,218 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:27,218 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:27,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:27,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:27,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:27,245 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:27,408 INFO ]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:08:27,408 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:27,408 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:27,408 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:27,408 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:27,408 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:27,409 INFO ]: Start difference. First operand 429 states and 945 transitions. Second operand 4 states. [2018-06-22 02:08:28,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:28,089 INFO ]: Finished difference Result 675 states and 1834 transitions. [2018-06-22 02:08:28,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:08:28,089 INFO ]: Start accepts. Automaton has 4 states. Word has length 23 [2018-06-22 02:08:28,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:28,172 INFO ]: With dead ends: 675 [2018-06-22 02:08:28,172 INFO ]: Without dead ends: 675 [2018-06-22 02:08:28,172 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:28,173 INFO ]: Start minimizeSevpa. Operand 675 states. [2018-06-22 02:08:28,230 INFO ]: Finished minimizeSevpa. Reduced states from 675 to 441. [2018-06-22 02:08:28,230 INFO ]: Start removeUnreachable. Operand 441 states. [2018-06-22 02:08:28,242 INFO ]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1011 transitions. [2018-06-22 02:08:28,242 INFO ]: Start accepts. Automaton has 441 states and 1011 transitions. Word has length 23 [2018-06-22 02:08:28,242 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:28,242 INFO ]: Abstraction has 441 states and 1011 transitions. [2018-06-22 02:08:28,242 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:28,242 INFO ]: Start isEmpty. Operand 441 states and 1011 transitions. [2018-06-22 02:08:28,285 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:08:28,285 INFO ]: Found error trace [2018-06-22 02:08:28,285 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:28,285 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:28,285 INFO ]: Analyzing trace with hash 1027513310, now seen corresponding path program 1 times [2018-06-22 02:08:28,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:28,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:28,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:28,286 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:28,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:28,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:28,381 INFO ]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:08:28,381 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:28,381 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-22 02:08:28,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:28,439 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:28,448 INFO ]: Computing forward predicates... [2018-06-22 02:08:28,470 INFO ]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:08:28,509 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:08:28,509 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-22 02:08:28,510 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:28,510 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:28,510 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:28,510 INFO ]: Start difference. First operand 441 states and 1011 transitions. Second operand 3 states. [2018-06-22 02:08:28,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:28,994 INFO ]: Finished difference Result 645 states and 1690 transitions. [2018-06-22 02:08:28,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:28,994 INFO ]: Start accepts. Automaton has 3 states. Word has length 23 [2018-06-22 02:08:28,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:29,087 INFO ]: With dead ends: 645 [2018-06-22 02:08:29,088 INFO ]: Without dead ends: 645 [2018-06-22 02:08:29,088 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 24 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-22 02:08:29,088 INFO ]: Start minimizeSevpa. Operand 645 states. [2018-06-22 02:08:29,161 INFO ]: Finished minimizeSevpa. Reduced states from 645 to 441. [2018-06-22 02:08:29,161 INFO ]: Start removeUnreachable. Operand 441 states. [2018-06-22 02:08:29,176 INFO ]: Finished removeUnreachable. Reduced from 441 states to 441 states and 999 transitions. [2018-06-22 02:08:29,176 INFO ]: Start accepts. Automaton has 441 states and 999 transitions. Word has length 23 [2018-06-22 02:08:29,177 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:29,177 INFO ]: Abstraction has 441 states and 999 transitions. [2018-06-22 02:08:29,177 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:29,177 INFO ]: Start isEmpty. Operand 441 states and 999 transitions. [2018-06-22 02:08:29,221 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 02:08:29,221 INFO ]: Found error trace [2018-06-22 02:08:29,221 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:29,221 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:29,221 INFO ]: Analyzing trace with hash -1942187268, now seen corresponding path program 1 times [2018-06-22 02:08:29,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:29,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:29,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,223 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:29,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:29,364 INFO ]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:08:29,364 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:29,364 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:29,364 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:29,365 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:29,365 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:29,365 INFO ]: Start difference. First operand 441 states and 999 transitions. Second operand 3 states. [2018-06-22 02:08:29,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:29,702 INFO ]: Finished difference Result 789 states and 2098 transitions. [2018-06-22 02:08:29,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:29,703 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-22 02:08:29,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:29,808 INFO ]: With dead ends: 789 [2018-06-22 02:08:29,808 INFO ]: Without dead ends: 789 [2018-06-22 02:08:29,808 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-22 02:08:29,808 INFO ]: Start minimizeSevpa. Operand 789 states. [2018-06-22 02:08:29,883 INFO ]: Finished minimizeSevpa. Reduced states from 789 to 447. [2018-06-22 02:08:29,883 INFO ]: Start removeUnreachable. Operand 447 states. [2018-06-22 02:08:29,896 INFO ]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1023 transitions. [2018-06-22 02:08:29,896 INFO ]: Start accepts. Automaton has 447 states and 1023 transitions. Word has length 24 [2018-06-22 02:08:29,896 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:29,896 INFO ]: Abstraction has 447 states and 1023 transitions. [2018-06-22 02:08:29,896 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:29,897 INFO ]: Start isEmpty. Operand 447 states and 1023 transitions. [2018-06-22 02:08:29,936 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 02:08:29,936 INFO ]: Found error trace [2018-06-22 02:08:29,936 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:29,936 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:29,937 INFO ]: Analyzing trace with hash 946956788, now seen corresponding path program 1 times [2018-06-22 02:08:29,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:29,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:29,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:29,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,947 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:30,009 INFO ]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:08:30,009 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:30,009 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:30,009 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:30,009 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:30,009 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:30,010 INFO ]: Start difference. First operand 447 states and 1023 transitions. Second operand 3 states. [2018-06-22 02:08:30,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:30,554 INFO ]: Finished difference Result 795 states and 2182 transitions. [2018-06-22 02:08:30,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:30,554 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-22 02:08:30,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:30,663 INFO ]: With dead ends: 795 [2018-06-22 02:08:30,663 INFO ]: Without dead ends: 795 [2018-06-22 02:08:30,663 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-22 02:08:30,664 INFO ]: Start minimizeSevpa. Operand 795 states. [2018-06-22 02:08:30,745 INFO ]: Finished minimizeSevpa. Reduced states from 795 to 453. [2018-06-22 02:08:30,745 INFO ]: Start removeUnreachable. Operand 453 states. [2018-06-22 02:08:30,759 INFO ]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1053 transitions. [2018-06-22 02:08:30,761 INFO ]: Start accepts. Automaton has 453 states and 1053 transitions. Word has length 24 [2018-06-22 02:08:30,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:30,761 INFO ]: Abstraction has 453 states and 1053 transitions. [2018-06-22 02:08:30,761 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:30,761 INFO ]: Start isEmpty. Operand 453 states and 1053 transitions. [2018-06-22 02:08:30,797 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 02:08:30,797 INFO ]: Found error trace [2018-06-22 02:08:30,798 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:30,798 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:30,798 INFO ]: Analyzing trace with hash 357505646, now seen corresponding path program 1 times [2018-06-22 02:08:30,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:30,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:30,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:30,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:30,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:30,815 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:31,171 WARN ]: Spent 305.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-06-22 02:08:31,172 INFO ]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:08:31,172 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:31,172 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:31,172 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:31,172 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:31,172 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:31,172 INFO ]: Start difference. First operand 453 states and 1053 transitions. Second operand 3 states. [2018-06-22 02:08:31,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:31,790 INFO ]: Finished difference Result 795 states and 2170 transitions. [2018-06-22 02:08:31,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:31,791 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-22 02:08:31,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:31,905 INFO ]: With dead ends: 795 [2018-06-22 02:08:31,905 INFO ]: Without dead ends: 795 [2018-06-22 02:08:31,905 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:31,906 INFO ]: Start minimizeSevpa. Operand 795 states. [2018-06-22 02:08:31,974 INFO ]: Finished minimizeSevpa. Reduced states from 795 to 465. [2018-06-22 02:08:31,974 INFO ]: Start removeUnreachable. Operand 465 states. [2018-06-22 02:08:31,988 INFO ]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1089 transitions. [2018-06-22 02:08:31,988 INFO ]: Start accepts. Automaton has 465 states and 1089 transitions. Word has length 24 [2018-06-22 02:08:31,988 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:31,988 INFO ]: Abstraction has 465 states and 1089 transitions. [2018-06-22 02:08:31,988 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:31,988 INFO ]: Start isEmpty. Operand 465 states and 1089 transitions. [2018-06-22 02:08:32,024 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 02:08:32,024 INFO ]: Found error trace [2018-06-22 02:08:32,024 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:32,024 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:32,024 INFO ]: Analyzing trace with hash -1422658711, now seen corresponding path program 1 times [2018-06-22 02:08:32,024 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:32,024 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:32,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:32,026 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:32,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:32,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:32,181 INFO ]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:08:32,181 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:32,182 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:32,182 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:32,182 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:32,182 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:32,182 INFO ]: Start difference. First operand 465 states and 1089 transitions. Second operand 4 states. [2018-06-22 02:08:35,529 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:35,529 INFO ]: Finished difference Result 654 states and 1545 transitions. [2018-06-22 02:08:35,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:35,530 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 02:08:35,530 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:35,547 INFO ]: With dead ends: 654 [2018-06-22 02:08:35,547 INFO ]: Without dead ends: 465 [2018-06-22 02:08:35,547 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:08:35,547 INFO ]: Start minimizeSevpa. Operand 465 states. [2018-06-22 02:08:35,584 INFO ]: Finished minimizeSevpa. Reduced states from 465 to 465. [2018-06-22 02:08:35,584 INFO ]: Start removeUnreachable. Operand 465 states. [2018-06-22 02:08:35,592 INFO ]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1074 transitions. [2018-06-22 02:08:35,592 INFO ]: Start accepts. Automaton has 465 states and 1074 transitions. Word has length 25 [2018-06-22 02:08:35,593 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:35,593 INFO ]: Abstraction has 465 states and 1074 transitions. [2018-06-22 02:08:35,593 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:35,593 INFO ]: Start isEmpty. Operand 465 states and 1074 transitions. [2018-06-22 02:08:35,605 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 02:08:35,605 INFO ]: Found error trace [2018-06-22 02:08:35,605 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:35,606 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:35,606 INFO ]: Analyzing trace with hash -551914708, now seen corresponding path program 1 times [2018-06-22 02:08:35,606 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:35,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:35,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:35,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:35,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:35,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:35,683 INFO ]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:08:35,683 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:35,683 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:35,684 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:35,684 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:35,684 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:35,684 INFO ]: Start difference. First operand 465 states and 1074 transitions. Second operand 4 states. [2018-06-22 02:08:35,960 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:35,960 INFO ]: Finished difference Result 831 states and 2311 transitions. [2018-06-22 02:08:35,960 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:08:35,960 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 02:08:35,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:36,016 INFO ]: With dead ends: 831 [2018-06-22 02:08:36,016 INFO ]: Without dead ends: 831 [2018-06-22 02:08:36,016 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:36,017 INFO ]: Start minimizeSevpa. Operand 831 states. [2018-06-22 02:08:36,090 INFO ]: Finished minimizeSevpa. Reduced states from 831 to 471. [2018-06-22 02:08:36,090 INFO ]: Start removeUnreachable. Operand 471 states. [2018-06-22 02:08:36,138 INFO ]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1086 transitions. [2018-06-22 02:08:36,138 INFO ]: Start accepts. Automaton has 471 states and 1086 transitions. Word has length 25 [2018-06-22 02:08:36,138 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:36,138 INFO ]: Abstraction has 471 states and 1086 transitions. [2018-06-22 02:08:36,138 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:36,138 INFO ]: Start isEmpty. Operand 471 states and 1086 transitions. [2018-06-22 02:08:36,154 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 02:08:36,154 INFO ]: Found error trace [2018-06-22 02:08:36,154 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:36,154 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:36,154 INFO ]: Analyzing trace with hash 156419334, now seen corresponding path program 1 times [2018-06-22 02:08:36,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:36,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:36,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:36,157 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:36,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:36,161 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:36,232 INFO ]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:08:36,232 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:36,232 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:36,232 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:36,232 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:36,232 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:36,232 INFO ]: Start difference. First operand 471 states and 1086 transitions. Second operand 3 states. [2018-06-22 02:08:36,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:36,618 INFO ]: Finished difference Result 657 states and 1741 transitions. [2018-06-22 02:08:36,618 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:36,618 INFO ]: Start accepts. Automaton has 3 states. Word has length 25 [2018-06-22 02:08:36,618 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:36,646 INFO ]: With dead ends: 657 [2018-06-22 02:08:36,646 INFO ]: Without dead ends: 657 [2018-06-22 02:08:36,649 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-22 02:08:36,649 INFO ]: Start minimizeSevpa. Operand 657 states. [2018-06-22 02:08:36,695 INFO ]: Finished minimizeSevpa. Reduced states from 657 to 471. [2018-06-22 02:08:36,695 INFO ]: Start removeUnreachable. Operand 471 states. [2018-06-22 02:08:36,704 INFO ]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1074 transitions. [2018-06-22 02:08:36,704 INFO ]: Start accepts. Automaton has 471 states and 1074 transitions. Word has length 25 [2018-06-22 02:08:36,704 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:36,704 INFO ]: Abstraction has 471 states and 1074 transitions. [2018-06-22 02:08:36,704 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:36,704 INFO ]: Start isEmpty. Operand 471 states and 1074 transitions. [2018-06-22 02:08:36,720 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 02:08:36,720 INFO ]: Found error trace [2018-06-22 02:08:36,721 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:36,721 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:36,721 INFO ]: Analyzing trace with hash -1902260780, now seen corresponding path program 1 times [2018-06-22 02:08:36,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:36,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:36,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:36,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:36,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:36,735 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:36,854 INFO ]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:08:36,854 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:36,854 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-22 02:08:36,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:36,902 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:36,905 INFO ]: Computing forward predicates... [2018-06-22 02:08:37,058 INFO ]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:08:37,092 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:08:37,092 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-06-22 02:08:37,092 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:08:37,092 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:08:37,092 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:08:37,093 INFO ]: Start difference. First operand 471 states and 1074 transitions. Second operand 11 states. [2018-06-22 02:08:46,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:46,731 INFO ]: Finished difference Result 3306 states and 17263 transitions. [2018-06-22 02:08:46,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 02:08:46,731 INFO ]: Start accepts. Automaton has 11 states. Word has length 26 [2018-06-22 02:08:46,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:47,159 INFO ]: With dead ends: 3306 [2018-06-22 02:08:47,159 INFO ]: Without dead ends: 2873 [2018-06-22 02:08:47,160 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=411, Invalid=1845, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 02:08:47,161 INFO ]: Start minimizeSevpa. Operand 2873 states. [2018-06-22 02:08:47,995 INFO ]: Finished minimizeSevpa. Reduced states from 2873 to 725. [2018-06-22 02:08:47,996 INFO ]: Start removeUnreachable. Operand 725 states. [2018-06-22 02:08:48,105 INFO ]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1870 transitions. [2018-06-22 02:08:48,105 INFO ]: Start accepts. Automaton has 725 states and 1870 transitions. Word has length 26 [2018-06-22 02:08:48,106 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:48,106 INFO ]: Abstraction has 725 states and 1870 transitions. [2018-06-22 02:08:48,106 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:08:48,106 INFO ]: Start isEmpty. Operand 725 states and 1870 transitions. [2018-06-22 02:08:48,121 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 02:08:48,121 INFO ]: Found error trace [2018-06-22 02:08:48,121 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:48,121 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:48,121 INFO ]: Analyzing trace with hash -789158162, now seen corresponding path program 1 times [2018-06-22 02:08:48,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:48,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:48,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:48,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:48,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:48,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:48,276 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:08:48,276 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:48,276 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:48,276 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:48,276 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:48,276 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:48,276 INFO ]: Start difference. First operand 725 states and 1870 transitions. Second operand 4 states. [2018-06-22 02:08:48,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:48,678 INFO ]: Finished difference Result 1068 states and 2805 transitions. [2018-06-22 02:08:48,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:48,678 INFO ]: Start accepts. Automaton has 4 states. Word has length 26 [2018-06-22 02:08:48,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:48,696 INFO ]: With dead ends: 1068 [2018-06-22 02:08:48,696 INFO ]: Without dead ends: 725 [2018-06-22 02:08:48,696 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:08:48,696 INFO ]: Start minimizeSevpa. Operand 725 states. [2018-06-22 02:08:48,749 INFO ]: Finished minimizeSevpa. Reduced states from 725 to 725. [2018-06-22 02:08:48,749 INFO ]: Start removeUnreachable. Operand 725 states. [2018-06-22 02:08:48,767 INFO ]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1866 transitions. [2018-06-22 02:08:48,768 INFO ]: Start accepts. Automaton has 725 states and 1866 transitions. Word has length 26 [2018-06-22 02:08:48,768 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:48,768 INFO ]: Abstraction has 725 states and 1866 transitions. [2018-06-22 02:08:48,768 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:48,768 INFO ]: Start isEmpty. Operand 725 states and 1866 transitions. [2018-06-22 02:08:48,784 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 02:08:48,785 INFO ]: Found error trace [2018-06-22 02:08:48,785 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:48,785 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:48,785 INFO ]: Analyzing trace with hash -1563078997, now seen corresponding path program 1 times [2018-06-22 02:08:48,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:48,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:48,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:48,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:48,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:48,798 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:48,901 INFO ]: Checked inductivity of 25 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:08:48,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:48,901 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-22 02:08:48,908 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:48,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:48,956 INFO ]: Computing forward predicates... [2018-06-22 02:08:49,131 INFO ]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 02:08:49,151 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:08:49,151 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-06-22 02:08:49,152 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:08:49,152 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:08:49,152 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:08:49,152 INFO ]: Start difference. First operand 725 states and 1866 transitions. Second operand 12 states. [2018-06-22 02:09:07,641 WARN ]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-22 02:09:10,171 WARN ]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 02:09:13,204 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 Received shutdown request... [2018-06-22 02:09:17,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-06-22 02:09:17,666 WARN ]: Verification canceled [2018-06-22 02:09:17,710 WARN ]: Timeout [2018-06-22 02:09:17,711 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:09:17 BoogieIcfgContainer [2018-06-22 02:09:17,711 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:09:17,712 INFO ]: Toolchain (without parser) took 58089.32 ms. Allocated memory was 306.2 MB in the beginning and 1.2 GB in the end (delta: 891.3 MB). Free memory was 254.6 MB in the beginning and 381.9 MB in the end (delta: -127.3 MB). Peak memory consumption was 764.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:09:17,712 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:09:17,713 INFO ]: ChcToBoogie took 89.18 ms. Allocated memory is still 306.2 MB. Free memory was 254.6 MB in the beginning and 251.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. [2018-06-22 02:09:17,713 INFO ]: Boogie Preprocessor took 62.63 ms. Allocated memory is still 306.2 MB. Free memory was 251.5 MB in the beginning and 250.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 02:09:17,714 INFO ]: RCFGBuilder took 1173.00 ms. Allocated memory is still 306.2 MB. Free memory was 249.5 MB in the beginning and 215.5 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:09:17,716 INFO ]: TraceAbstraction took 56752.20 ms. Allocated memory was 306.2 MB in the beginning and 1.2 GB in the end (delta: 891.3 MB). Free memory was 214.5 MB in the beginning and 381.9 MB in the end (delta: -167.4 MB). Peak memory consumption was 723.9 MB. Max. memory is 3.6 GB. [2018-06-22 02:09:17,719 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 89.18 ms. Allocated memory is still 306.2 MB. Free memory was 254.6 MB in the beginning and 251.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 62.63 ms. Allocated memory is still 306.2 MB. Free memory was 251.5 MB in the beginning and 250.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 1173.00 ms. Allocated memory is still 306.2 MB. Free memory was 249.5 MB in the beginning and 215.5 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56752.20 ms. Allocated memory was 306.2 MB in the beginning and 1.2 GB in the end (delta: 891.3 MB). Free memory was 214.5 MB in the beginning and 381.9 MB in the end (delta: -167.4 MB). Peak memory consumption was 723.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (725states) and interpolant automaton (currently 179 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (6099 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. TIMEOUT Result, 56.6s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 51.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5399 SDtfs, 5721 SDslu, 14851 SDs, 0 SdLazy, 33300 SolverSat, 12421 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 430 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15048 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=725occurred in iteration=16, 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: 2.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 4662 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 14712 SizeOfPredicates, 7 NumberOfNonLiveVariables, 585 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 155/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__ackermann!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-09-17-736.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__ackermann!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-09-17-736.csv Completed graceful shutdown