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/hopv/lia/mochi/kmp.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:48:41,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:48:41,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:48:41,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:48:41,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:48:41,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:48:41,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:48:41,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:48:41,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:48:41,125 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:48:41,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:48:41,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:48:41,127 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:48:41,128 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:48:41,132 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:48:41,133 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:48:41,134 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:48:41,145 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:48:41,146 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:48:41,147 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:48:41,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:48:41,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:48:41,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:48:41,153 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:48:41,154 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:48:41,155 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:48:41,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:48:41,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:48:41,159 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:48:41,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:48:41,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:48:41,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:48:41,165 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:48:41,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:48:41,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:48:41,167 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:48:41,188 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:48:41,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:48:41,189 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:48:41,189 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:48:41,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:48:41,190 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:48:41,190 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:48:41,191 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:48:41,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:48:41,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:48:41,194 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:48:41,194 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:48:41,194 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:48:41,195 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:48:41,195 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:48:41,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:48:41,195 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:48:41,196 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:48:41,198 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:48:41,242 INFO ]: Repository-Root is: /tmp [2018-06-22 01:48:41,258 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:48:41,264 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:48:41,266 INFO ]: Initializing SmtParser... [2018-06-22 01:48:41,266 INFO ]: SmtParser initialized [2018-06-22 01:48:41,280 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/kmp.smt2 [2018-06-22 01:48:41,282 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 01:48:41,377 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/kmp.smt2 unknown [2018-06-22 01:48:42,304 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/kmp.smt2 [2018-06-22 01:48:42,310 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:48:42,316 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:48:42,317 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:48:42,317 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:48:42,317 INFO ]: ChcToBoogie initialized [2018-06-22 01:48:42,320 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:48:42" (1/1) ... [2018-06-22 01:48:42,431 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:42 Unit [2018-06-22 01:48:42,431 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:48:42,433 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:48:42,433 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:48:42,433 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:48:42,456 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:42" (1/1) ... [2018-06-22 01:48:42,456 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:42" (1/1) ... [2018-06-22 01:48:42,478 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:42" (1/1) ... [2018-06-22 01:48:42,478 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:42" (1/1) ... [2018-06-22 01:48:42,526 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:42" (1/1) ... [2018-06-22 01:48:42,542 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:42" (1/1) ... [2018-06-22 01:48:42,546 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:42" (1/1) ... [2018-06-22 01:48:42,561 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:48:42,562 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:48:42,562 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:48:42,562 INFO ]: RCFGBuilder initialized [2018-06-22 01:48:42,563 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:42" (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 01:48:42,590 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:48:42,590 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:48:42,590 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:48:42,590 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:48:42,590 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:48:42,590 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 01:48:46,076 INFO ]: Using library mode [2018-06-22 01:48:46,077 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:48:46 BoogieIcfgContainer [2018-06-22 01:48:46,077 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:48:46,078 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:48:46,078 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:48:46,083 INFO ]: TraceAbstraction initialized [2018-06-22 01:48:46,084 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:48:42" (1/3) ... [2018-06-22 01:48:46,085 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e19cf16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:48:46, skipping insertion in model container [2018-06-22 01:48:46,085 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:42" (2/3) ... [2018-06-22 01:48:46,085 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e19cf16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:48:46, skipping insertion in model container [2018-06-22 01:48:46,085 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:48:46" (3/3) ... [2018-06-22 01:48:46,087 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:48:46,140 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:48:46,151 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:48:46,228 INFO ]: Using default assertion order modulation [2018-06-22 01:48:46,229 INFO ]: Interprodecural is true [2018-06-22 01:48:46,229 INFO ]: Hoare is false [2018-06-22 01:48:46,229 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:48:46,229 INFO ]: Backedges is TWOTRACK [2018-06-22 01:48:46,229 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:48:46,229 INFO ]: Difference is false [2018-06-22 01:48:46,229 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:48:46,229 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:48:46,277 INFO ]: Start isEmpty. Operand 262 states. [2018-06-22 01:48:46,298 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:48:46,298 INFO ]: Found error trace [2018-06-22 01:48:46,299 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:46,299 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:46,305 INFO ]: Analyzing trace with hash -911069598, now seen corresponding path program 1 times [2018-06-22 01:48:46,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:46,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:46,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:46,346 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:46,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:46,390 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:46,475 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:48:46,478 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:48:46,478 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:48:46,480 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:46,492 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:46,493 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:46,496 INFO ]: Start difference. First operand 262 states. Second operand 4 states. [2018-06-22 01:48:49,810 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:49,810 INFO ]: Finished difference Result 517 states and 911 transitions. [2018-06-22 01:48:49,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:49,811 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 01:48:49,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:49,883 INFO ]: With dead ends: 517 [2018-06-22 01:48:49,883 INFO ]: Without dead ends: 503 [2018-06-22 01:48:49,885 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 01:48:49,907 INFO ]: Start minimizeSevpa. Operand 503 states. [2018-06-22 01:48:50,176 INFO ]: Finished minimizeSevpa. Reduced states from 503 to 503. [2018-06-22 01:48:50,177 INFO ]: Start removeUnreachable. Operand 503 states. [2018-06-22 01:48:50,215 INFO ]: Finished removeUnreachable. Reduced from 503 states to 503 states and 893 transitions. [2018-06-22 01:48:50,217 INFO ]: Start accepts. Automaton has 503 states and 893 transitions. Word has length 7 [2018-06-22 01:48:50,217 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:50,217 INFO ]: Abstraction has 503 states and 893 transitions. [2018-06-22 01:48:50,217 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:50,217 INFO ]: Start isEmpty. Operand 503 states and 893 transitions. [2018-06-22 01:48:50,223 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:48:50,223 INFO ]: Found error trace [2018-06-22 01:48:50,223 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:50,224 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:50,224 INFO ]: Analyzing trace with hash -22260085, now seen corresponding path program 1 times [2018-06-22 01:48:50,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:50,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:50,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:50,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:50,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:50,237 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:50,382 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:48:50,382 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:48:50,382 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:48:50,384 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:50,384 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:50,384 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:50,384 INFO ]: Start difference. First operand 503 states and 893 transitions. Second operand 4 states. [2018-06-22 01:48:53,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:53,590 INFO ]: Finished difference Result 753 states and 1338 transitions. [2018-06-22 01:48:53,590 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:53,590 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 01:48:53,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:53,670 INFO ]: With dead ends: 753 [2018-06-22 01:48:53,670 INFO ]: Without dead ends: 753 [2018-06-22 01:48:53,673 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 01:48:53,673 INFO ]: Start minimizeSevpa. Operand 753 states. [2018-06-22 01:48:53,830 INFO ]: Finished minimizeSevpa. Reduced states from 753 to 753. [2018-06-22 01:48:53,830 INFO ]: Start removeUnreachable. Operand 753 states. [2018-06-22 01:48:53,875 INFO ]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1338 transitions. [2018-06-22 01:48:53,876 INFO ]: Start accepts. Automaton has 753 states and 1338 transitions. Word has length 13 [2018-06-22 01:48:53,877 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:53,877 INFO ]: Abstraction has 753 states and 1338 transitions. [2018-06-22 01:48:53,877 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:53,877 INFO ]: Start isEmpty. Operand 753 states and 1338 transitions. [2018-06-22 01:48:53,893 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:48:53,893 INFO ]: Found error trace [2018-06-22 01:48:53,893 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:53,893 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:53,893 INFO ]: Analyzing trace with hash -545782784, now seen corresponding path program 1 times [2018-06-22 01:48:53,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:53,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:53,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:53,894 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:53,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:53,955 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:54,025 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:48:54,025 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:48:54,025 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:48:54,025 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:54,025 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:54,025 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:54,025 INFO ]: Start difference. First operand 753 states and 1338 transitions. Second operand 4 states. [2018-06-22 01:48:56,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:56,986 INFO ]: Finished difference Result 939 states and 1667 transitions. [2018-06-22 01:48:56,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:56,987 INFO ]: Start accepts. Automaton has 4 states. Word has length 20 [2018-06-22 01:48:56,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:57,080 INFO ]: With dead ends: 939 [2018-06-22 01:48:57,080 INFO ]: Without dead ends: 939 [2018-06-22 01:48:57,081 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 01:48:57,082 INFO ]: Start minimizeSevpa. Operand 939 states. [2018-06-22 01:48:57,197 INFO ]: Finished minimizeSevpa. Reduced states from 939 to 939. [2018-06-22 01:48:57,197 INFO ]: Start removeUnreachable. Operand 939 states. [2018-06-22 01:48:57,246 INFO ]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1667 transitions. [2018-06-22 01:48:57,246 INFO ]: Start accepts. Automaton has 939 states and 1667 transitions. Word has length 20 [2018-06-22 01:48:57,247 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:57,247 INFO ]: Abstraction has 939 states and 1667 transitions. [2018-06-22 01:48:57,247 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:57,247 INFO ]: Start isEmpty. Operand 939 states and 1667 transitions. [2018-06-22 01:48:57,277 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:48:57,277 INFO ]: Found error trace [2018-06-22 01:48:57,277 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:57,277 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:57,278 INFO ]: Analyzing trace with hash -1669858612, now seen corresponding path program 1 times [2018-06-22 01:48:57,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:57,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:57,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:57,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:57,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:57,288 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:57,438 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:48:57,438 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:48:57,438 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:48:57,438 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:57,438 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:57,438 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:57,439 INFO ]: Start difference. First operand 939 states and 1667 transitions. Second operand 4 states. [2018-06-22 01:48:59,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:59,086 INFO ]: Finished difference Result 1084 states and 1931 transitions. [2018-06-22 01:48:59,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:59,087 INFO ]: Start accepts. Automaton has 4 states. Word has length 31 [2018-06-22 01:48:59,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:59,173 INFO ]: With dead ends: 1084 [2018-06-22 01:48:59,173 INFO ]: Without dead ends: 1084 [2018-06-22 01:48:59,173 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 01:48:59,174 INFO ]: Start minimizeSevpa. Operand 1084 states. [2018-06-22 01:48:59,286 INFO ]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2018-06-22 01:48:59,286 INFO ]: Start removeUnreachable. Operand 1084 states. [2018-06-22 01:48:59,356 INFO ]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1931 transitions. [2018-06-22 01:48:59,356 INFO ]: Start accepts. Automaton has 1084 states and 1931 transitions. Word has length 31 [2018-06-22 01:48:59,356 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:59,356 INFO ]: Abstraction has 1084 states and 1931 transitions. [2018-06-22 01:48:59,356 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:59,356 INFO ]: Start isEmpty. Operand 1084 states and 1931 transitions. [2018-06-22 01:48:59,413 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:48:59,413 INFO ]: Found error trace [2018-06-22 01:48:59,414 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:59,414 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:59,414 INFO ]: Analyzing trace with hash -723325442, now seen corresponding path program 1 times [2018-06-22 01:48:59,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:59,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:59,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:59,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:59,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:59,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:59,605 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:48:59,605 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:48:59,605 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 01:48:59,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:59,662 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:59,672 INFO ]: Computing forward predicates... [2018-06-22 01:48:59,712 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:48:59,744 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:48:59,762 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:48:59,762 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:59,763 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:59,763 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:59,763 INFO ]: Start difference. First operand 1084 states and 1931 transitions. Second operand 4 states. [2018-06-22 01:49:05,808 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:05,808 INFO ]: Finished difference Result 1228 states and 2194 transitions. [2018-06-22 01:49:05,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:05,809 INFO ]: Start accepts. Automaton has 4 states. Word has length 43 [2018-06-22 01:49:05,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:05,969 INFO ]: With dead ends: 1228 [2018-06-22 01:49:05,969 INFO ]: Without dead ends: 1228 [2018-06-22 01:49:05,969 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 45 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 01:49:05,971 INFO ]: Start minimizeSevpa. Operand 1228 states. [2018-06-22 01:49:06,256 INFO ]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2018-06-22 01:49:06,256 INFO ]: Start removeUnreachable. Operand 1228 states. [2018-06-22 01:49:06,344 INFO ]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 2194 transitions. [2018-06-22 01:49:06,344 INFO ]: Start accepts. Automaton has 1228 states and 2194 transitions. Word has length 43 [2018-06-22 01:49:06,344 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:06,344 INFO ]: Abstraction has 1228 states and 2194 transitions. [2018-06-22 01:49:06,344 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:06,344 INFO ]: Start isEmpty. Operand 1228 states and 2194 transitions. [2018-06-22 01:49:06,412 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 01:49:06,412 INFO ]: Found error trace [2018-06-22 01:49:06,412 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:06,412 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:06,413 INFO ]: Analyzing trace with hash 2133826132, now seen corresponding path program 1 times [2018-06-22 01:49:06,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:06,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:06,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:06,415 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:06,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:06,457 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:06,687 WARN ]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 01:49:06,825 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:06,825 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:49:06,825 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:49:06,825 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:49:06,825 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:49:06,825 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:49:06,826 INFO ]: Start difference. First operand 1228 states and 2194 transitions. Second operand 6 states. [2018-06-22 01:49:10,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:10,637 INFO ]: Finished difference Result 2782 states and 11778 transitions. [2018-06-22 01:49:10,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:49:10,638 INFO ]: Start accepts. Automaton has 6 states. Word has length 45 [2018-06-22 01:49:10,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:11,407 INFO ]: With dead ends: 2782 [2018-06-22 01:49:11,407 INFO ]: Without dead ends: 2782 [2018-06-22 01:49:11,407 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:49:11,409 INFO ]: Start minimizeSevpa. Operand 2782 states. [2018-06-22 01:49:12,526 INFO ]: Finished minimizeSevpa. Reduced states from 2782 to 1263. [2018-06-22 01:49:12,526 INFO ]: Start removeUnreachable. Operand 1263 states. [2018-06-22 01:49:12,604 INFO ]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2280 transitions. [2018-06-22 01:49:12,604 INFO ]: Start accepts. Automaton has 1263 states and 2280 transitions. Word has length 45 [2018-06-22 01:49:12,604 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:12,604 INFO ]: Abstraction has 1263 states and 2280 transitions. [2018-06-22 01:49:12,604 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:49:12,605 INFO ]: Start isEmpty. Operand 1263 states and 2280 transitions. [2018-06-22 01:49:12,635 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 01:49:12,635 INFO ]: Found error trace [2018-06-22 01:49:12,636 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:12,638 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:12,638 INFO ]: Analyzing trace with hash -90535241, now seen corresponding path program 1 times [2018-06-22 01:49:12,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:12,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:12,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:12,639 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:12,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:12,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:12,775 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:12,775 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:49:12,775 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:49:12,776 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:49:12,776 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:49:12,776 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:49:12,776 INFO ]: Start difference. First operand 1263 states and 2280 transitions. Second operand 6 states. [2018-06-22 01:49:13,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:13,957 INFO ]: Finished difference Result 1984 states and 6835 transitions. [2018-06-22 01:49:13,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:49:13,957 INFO ]: Start accepts. Automaton has 6 states. Word has length 45 [2018-06-22 01:49:13,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:15,061 INFO ]: With dead ends: 1984 [2018-06-22 01:49:15,061 INFO ]: Without dead ends: 1984 [2018-06-22 01:49:15,062 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:49:15,062 INFO ]: Start minimizeSevpa. Operand 1984 states. [2018-06-22 01:49:15,436 INFO ]: Finished minimizeSevpa. Reduced states from 1984 to 1289. [2018-06-22 01:49:15,436 INFO ]: Start removeUnreachable. Operand 1289 states. [2018-06-22 01:49:15,527 INFO ]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2323 transitions. [2018-06-22 01:49:15,527 INFO ]: Start accepts. Automaton has 1289 states and 2323 transitions. Word has length 45 [2018-06-22 01:49:15,528 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:15,528 INFO ]: Abstraction has 1289 states and 2323 transitions. [2018-06-22 01:49:15,528 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:49:15,528 INFO ]: Start isEmpty. Operand 1289 states and 2323 transitions. [2018-06-22 01:49:15,575 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 01:49:15,575 INFO ]: Found error trace [2018-06-22 01:49:15,575 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:15,576 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:15,576 INFO ]: Analyzing trace with hash 75344081, now seen corresponding path program 1 times [2018-06-22 01:49:15,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:15,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:15,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:15,577 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:15,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:15,597 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:15,654 INFO ]: Checked inductivity of 29 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:49:15,654 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:15,654 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 01:49:15,661 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:15,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:15,699 INFO ]: Computing forward predicates... [2018-06-22 01:49:15,708 INFO ]: Checked inductivity of 29 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:49:15,738 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:15,738 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:49:15,738 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:49:15,738 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:49:15,738 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:49:15,738 INFO ]: Start difference. First operand 1289 states and 2323 transitions. Second operand 4 states. [2018-06-22 01:49:17,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:17,287 INFO ]: Finished difference Result 1550 states and 2791 transitions. [2018-06-22 01:49:17,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:17,288 INFO ]: Start accepts. Automaton has 4 states. Word has length 65 [2018-06-22 01:49:17,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:17,447 INFO ]: With dead ends: 1550 [2018-06-22 01:49:17,447 INFO ]: Without dead ends: 1550 [2018-06-22 01:49:17,447 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 67 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 01:49:17,448 INFO ]: Start minimizeSevpa. Operand 1550 states. [2018-06-22 01:49:17,619 INFO ]: Finished minimizeSevpa. Reduced states from 1550 to 1550. [2018-06-22 01:49:17,619 INFO ]: Start removeUnreachable. Operand 1550 states. [2018-06-22 01:49:17,724 INFO ]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2791 transitions. [2018-06-22 01:49:17,724 INFO ]: Start accepts. Automaton has 1550 states and 2791 transitions. Word has length 65 [2018-06-22 01:49:17,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:17,725 INFO ]: Abstraction has 1550 states and 2791 transitions. [2018-06-22 01:49:17,725 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:17,725 INFO ]: Start isEmpty. Operand 1550 states and 2791 transitions. [2018-06-22 01:49:17,780 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:49:17,780 INFO ]: Found error trace [2018-06-22 01:49:17,780 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:17,780 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:17,780 INFO ]: Analyzing trace with hash 1405639278, now seen corresponding path program 1 times [2018-06-22 01:49:17,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:17,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:17,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:17,782 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:17,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:17,798 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:17,874 INFO ]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:49:17,874 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:49:17,874 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:49:17,875 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:49:17,875 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:49:17,875 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:49:17,875 INFO ]: Start difference. First operand 1550 states and 2791 transitions. Second operand 4 states. [2018-06-22 01:49:19,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:19,557 INFO ]: Finished difference Result 1899 states and 3430 transitions. [2018-06-22 01:49:19,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:19,558 INFO ]: Start accepts. Automaton has 4 states. Word has length 48 [2018-06-22 01:49:19,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:19,708 INFO ]: With dead ends: 1899 [2018-06-22 01:49:19,708 INFO ]: Without dead ends: 1457 [2018-06-22 01:49:19,708 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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 01:49:19,709 INFO ]: Start minimizeSevpa. Operand 1457 states. [2018-06-22 01:49:19,884 INFO ]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2018-06-22 01:49:19,884 INFO ]: Start removeUnreachable. Operand 1457 states. [2018-06-22 01:49:19,962 INFO ]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2594 transitions. [2018-06-22 01:49:19,962 INFO ]: Start accepts. Automaton has 1457 states and 2594 transitions. Word has length 48 [2018-06-22 01:49:19,964 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:19,964 INFO ]: Abstraction has 1457 states and 2594 transitions. [2018-06-22 01:49:19,964 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:19,964 INFO ]: Start isEmpty. Operand 1457 states and 2594 transitions. [2018-06-22 01:49:19,995 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-22 01:49:19,995 INFO ]: Found error trace [2018-06-22 01:49:19,995 INFO ]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:19,995 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:19,996 INFO ]: Analyzing trace with hash 2054942318, now seen corresponding path program 1 times [2018-06-22 01:49:19,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:19,996 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:19,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:19,996 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:19,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:20,012 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:20,168 INFO ]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:49:20,168 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:20,168 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-22 01:49:20,184 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-22 01:49:20,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:20,230 INFO ]: Computing forward predicates... [2018-06-22 01:49:20,241 INFO ]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:49:20,275 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:20,275 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:49:20,275 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:49:20,276 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:49:20,276 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:49:20,276 INFO ]: Start difference. First operand 1457 states and 2594 transitions. Second operand 4 states. [2018-06-22 01:49:23,297 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:23,297 INFO ]: Finished difference Result 1817 states and 3244 transitions. [2018-06-22 01:49:23,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:23,297 INFO ]: Start accepts. Automaton has 4 states. Word has length 54 [2018-06-22 01:49:23,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:23,481 INFO ]: With dead ends: 1817 [2018-06-22 01:49:23,481 INFO ]: Without dead ends: 1596 [2018-06-22 01:49:23,481 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 56 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 01:49:23,483 INFO ]: Start minimizeSevpa. Operand 1596 states. [2018-06-22 01:49:23,658 INFO ]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2018-06-22 01:49:23,658 INFO ]: Start removeUnreachable. Operand 1596 states. [2018-06-22 01:49:23,744 INFO ]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2826 transitions. [2018-06-22 01:49:23,744 INFO ]: Start accepts. Automaton has 1596 states and 2826 transitions. Word has length 54 [2018-06-22 01:49:23,744 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:23,744 INFO ]: Abstraction has 1596 states and 2826 transitions. [2018-06-22 01:49:23,744 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:23,744 INFO ]: Start isEmpty. Operand 1596 states and 2826 transitions. [2018-06-22 01:49:23,797 INFO ]: Finished isEmpty. Found accepting run of length 95 [2018-06-22 01:49:23,797 INFO ]: Found error trace [2018-06-22 01:49:23,797 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:23,797 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:23,797 INFO ]: Analyzing trace with hash -171620302, now seen corresponding path program 1 times [2018-06-22 01:49:23,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:23,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:23,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:23,798 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:23,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:23,814 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:23,900 INFO ]: Checked inductivity of 92 backedges. 34 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 01:49:23,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:23,901 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-22 01:49:23,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:23,968 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:23,972 INFO ]: Computing forward predicates... [2018-06-22 01:49:23,998 INFO ]: Checked inductivity of 92 backedges. 34 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 01:49:24,032 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:24,032 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:49:24,032 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:49:24,033 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:49:24,033 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:49:24,033 INFO ]: Start difference. First operand 1596 states and 2826 transitions. Second operand 4 states. [2018-06-22 01:49:24,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:24,998 INFO ]: Finished difference Result 1861 states and 3309 transitions. [2018-06-22 01:49:24,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:24,998 INFO ]: Start accepts. Automaton has 4 states. Word has length 94 [2018-06-22 01:49:24,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:25,169 INFO ]: With dead ends: 1861 [2018-06-22 01:49:25,169 INFO ]: Without dead ends: 1647 [2018-06-22 01:49:25,169 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 96 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 01:49:25,170 INFO ]: Start minimizeSevpa. Operand 1647 states. [2018-06-22 01:49:25,319 INFO ]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2018-06-22 01:49:25,319 INFO ]: Start removeUnreachable. Operand 1647 states. [2018-06-22 01:49:25,406 INFO ]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2887 transitions. [2018-06-22 01:49:25,406 INFO ]: Start accepts. Automaton has 1647 states and 2887 transitions. Word has length 94 [2018-06-22 01:49:25,407 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:25,407 INFO ]: Abstraction has 1647 states and 2887 transitions. [2018-06-22 01:49:25,407 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:25,407 INFO ]: Start isEmpty. Operand 1647 states and 2887 transitions. [2018-06-22 01:49:25,444 INFO ]: Finished isEmpty. Found accepting run of length 115 [2018-06-22 01:49:25,444 INFO ]: Found error trace [2018-06-22 01:49:25,444 INFO ]: trace histogram [8, 8, 8, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:25,445 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:25,446 INFO ]: Analyzing trace with hash 320925402, now seen corresponding path program 1 times [2018-06-22 01:49:25,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:25,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:25,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:25,447 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:25,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:25,459 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:25,573 INFO ]: Checked inductivity of 180 backedges. 48 proven. 16 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-22 01:49:25,573 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:25,573 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-22 01:49:25,582 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:25,663 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:25,702 INFO ]: Computing forward predicates... [2018-06-22 01:49:25,728 INFO ]: Checked inductivity of 180 backedges. 48 proven. 16 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-22 01:49:25,755 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:25,755 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:49:25,755 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:49:25,755 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:49:25,755 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:49:25,755 INFO ]: Start difference. First operand 1647 states and 2887 transitions. Second operand 4 states. [2018-06-22 01:49:26,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:26,886 INFO ]: Finished difference Result 2004 states and 3530 transitions. [2018-06-22 01:49:26,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:26,886 INFO ]: Start accepts. Automaton has 4 states. Word has length 114 [2018-06-22 01:49:26,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:27,067 INFO ]: With dead ends: 2004 [2018-06-22 01:49:27,067 INFO ]: Without dead ends: 1787 [2018-06-22 01:49:27,067 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 116 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 01:49:27,068 INFO ]: Start minimizeSevpa. Operand 1787 states. [2018-06-22 01:49:27,250 INFO ]: Finished minimizeSevpa. Reduced states from 1787 to 1787. [2018-06-22 01:49:27,250 INFO ]: Start removeUnreachable. Operand 1787 states. [2018-06-22 01:49:27,347 INFO ]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 3119 transitions. [2018-06-22 01:49:27,348 INFO ]: Start accepts. Automaton has 1787 states and 3119 transitions. Word has length 114 [2018-06-22 01:49:27,348 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:27,348 INFO ]: Abstraction has 1787 states and 3119 transitions. [2018-06-22 01:49:27,348 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:27,348 INFO ]: Start isEmpty. Operand 1787 states and 3119 transitions. [2018-06-22 01:49:27,377 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-22 01:49:27,377 INFO ]: Found error trace [2018-06-22 01:49:27,377 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:27,377 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:27,377 INFO ]: Analyzing trace with hash 1933396898, now seen corresponding path program 1 times [2018-06-22 01:49:27,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:27,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:27,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:27,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:27,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:27,397 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:27,481 INFO ]: Checked inductivity of 58 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 01:49:27,481 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:49:27,481 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:49:27,481 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:49:27,481 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:49:27,481 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:49:27,481 INFO ]: Start difference. First operand 1787 states and 3119 transitions. Second operand 4 states. [2018-06-22 01:49:28,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:28,841 INFO ]: Finished difference Result 1987 states and 3485 transitions. [2018-06-22 01:49:28,841 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:28,841 INFO ]: Start accepts. Automaton has 4 states. Word has length 80 [2018-06-22 01:49:28,841 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:28,962 INFO ]: With dead ends: 1987 [2018-06-22 01:49:28,962 INFO ]: Without dead ends: 1987 [2018-06-22 01:49:28,963 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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 01:49:28,964 INFO ]: Start minimizeSevpa. Operand 1987 states. [2018-06-22 01:49:29,133 INFO ]: Finished minimizeSevpa. Reduced states from 1987 to 1987. [2018-06-22 01:49:29,133 INFO ]: Start removeUnreachable. Operand 1987 states. [2018-06-22 01:49:29,244 INFO ]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 3485 transitions. [2018-06-22 01:49:29,244 INFO ]: Start accepts. Automaton has 1987 states and 3485 transitions. Word has length 80 [2018-06-22 01:49:29,244 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:29,244 INFO ]: Abstraction has 1987 states and 3485 transitions. [2018-06-22 01:49:29,244 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:29,244 INFO ]: Start isEmpty. Operand 1987 states and 3485 transitions. [2018-06-22 01:49:29,270 INFO ]: Finished isEmpty. Found accepting run of length 103 [2018-06-22 01:49:29,270 INFO ]: Found error trace [2018-06-22 01:49:29,270 INFO ]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:29,270 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:29,270 INFO ]: Analyzing trace with hash 2020247861, now seen corresponding path program 1 times [2018-06-22 01:49:29,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:29,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:29,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:29,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:29,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:29,290 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:29,444 INFO ]: Checked inductivity of 107 backedges. 48 proven. 5 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-22 01:49:29,444 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:29,444 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:49:29,470 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:49:29,532 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:29,537 INFO ]: Computing forward predicates... [2018-06-22 01:49:29,566 INFO ]: Checked inductivity of 107 backedges. 48 proven. 5 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-22 01:49:29,600 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:29,600 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:49:29,600 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:49:29,600 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:49:29,600 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:49:29,600 INFO ]: Start difference. First operand 1987 states and 3485 transitions. Second operand 4 states. [2018-06-22 01:49:31,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:31,116 INFO ]: Finished difference Result 2130 states and 3729 transitions. [2018-06-22 01:49:31,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:31,117 INFO ]: Start accepts. Automaton has 4 states. Word has length 102 [2018-06-22 01:49:31,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:31,326 INFO ]: With dead ends: 2130 [2018-06-22 01:49:31,326 INFO ]: Without dead ends: 2130 [2018-06-22 01:49:31,326 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 104 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 01:49:31,328 INFO ]: Start minimizeSevpa. Operand 2130 states. [2018-06-22 01:49:31,539 INFO ]: Finished minimizeSevpa. Reduced states from 2130 to 2130. [2018-06-22 01:49:31,539 INFO ]: Start removeUnreachable. Operand 2130 states. [2018-06-22 01:49:31,648 INFO ]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3729 transitions. [2018-06-22 01:49:31,648 INFO ]: Start accepts. Automaton has 2130 states and 3729 transitions. Word has length 102 [2018-06-22 01:49:31,648 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:31,648 INFO ]: Abstraction has 2130 states and 3729 transitions. [2018-06-22 01:49:31,648 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:31,648 INFO ]: Start isEmpty. Operand 2130 states and 3729 transitions. [2018-06-22 01:49:31,682 INFO ]: Finished isEmpty. Found accepting run of length 68 [2018-06-22 01:49:31,682 INFO ]: Found error trace [2018-06-22 01:49:31,682 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:31,682 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:31,682 INFO ]: Analyzing trace with hash 125426866, now seen corresponding path program 1 times [2018-06-22 01:49:31,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:31,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:31,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:31,683 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:31,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:31,699 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:31,768 INFO ]: Checked inductivity of 28 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:49:31,768 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:49:31,768 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:49:31,768 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:49:31,768 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:49:31,768 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:49:31,768 INFO ]: Start difference. First operand 2130 states and 3729 transitions. Second operand 4 states. [2018-06-22 01:49:32,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:32,871 INFO ]: Finished difference Result 2470 states and 4342 transitions. [2018-06-22 01:49:32,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:32,871 INFO ]: Start accepts. Automaton has 4 states. Word has length 67 [2018-06-22 01:49:32,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:33,004 INFO ]: With dead ends: 2470 [2018-06-22 01:49:33,004 INFO ]: Without dead ends: 2293 [2018-06-22 01:49:33,005 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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 01:49:33,006 INFO ]: Start minimizeSevpa. Operand 2293 states. [2018-06-22 01:49:33,147 INFO ]: Finished minimizeSevpa. Reduced states from 2293 to 2293. [2018-06-22 01:49:33,148 INFO ]: Start removeUnreachable. Operand 2293 states. [2018-06-22 01:49:33,232 INFO ]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3991 transitions. [2018-06-22 01:49:33,232 INFO ]: Start accepts. Automaton has 2293 states and 3991 transitions. Word has length 67 [2018-06-22 01:49:33,232 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:33,232 INFO ]: Abstraction has 2293 states and 3991 transitions. [2018-06-22 01:49:33,232 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:33,232 INFO ]: Start isEmpty. Operand 2293 states and 3991 transitions. [2018-06-22 01:49:33,251 INFO ]: Finished isEmpty. Found accepting run of length 129 [2018-06-22 01:49:33,251 INFO ]: Found error trace [2018-06-22 01:49:33,251 INFO ]: trace histogram [8, 8, 8, 6, 6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:33,252 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:33,252 INFO ]: Analyzing trace with hash 1463372330, now seen corresponding path program 1 times [2018-06-22 01:49:33,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:33,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:33,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:33,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:33,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:33,299 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:33,739 INFO ]: Checked inductivity of 212 backedges. 60 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-06-22 01:49:33,739 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:33,739 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:49:33,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:33,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:33,814 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 01:49:33,845 INFO ]: Timeout while computing interpolants [2018-06-22 01:49:34,046 WARN ]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:49:34,046 WARN ]: Verification canceled [2018-06-22 01:49:34,049 WARN ]: Timeout [2018-06-22 01:49:34,050 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:49:34 BoogieIcfgContainer [2018-06-22 01:49:34,050 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:49:34,050 INFO ]: Toolchain (without parser) took 51740.12 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 219.3 MB in the beginning and 840.3 MB in the end (delta: -621.1 MB). Peak memory consumption was 608.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:49:34,051 INFO ]: SmtParser took 0.14 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:49:34,051 INFO ]: ChcToBoogie took 114.86 ms. Allocated memory is still 308.8 MB. Free memory was 218.2 MB in the beginning and 214.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:49:34,052 INFO ]: Boogie Preprocessor took 128.81 ms. Allocated memory is still 308.8 MB. Free memory was 214.3 MB in the beginning and 211.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:49:34,054 INFO ]: RCFGBuilder took 3515.12 ms. Allocated memory was 308.8 MB in the beginning and 330.8 MB in the end (delta: 22.0 MB). Free memory was 211.3 MB in the beginning and 226.2 MB in the end (delta: -14.9 MB). Peak memory consumption was 29.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:49:34,055 INFO ]: TraceAbstraction took 47971.44 ms. Allocated memory was 330.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 226.2 MB in the beginning and 840.3 MB in the end (delta: -614.1 MB). Peak memory consumption was 593.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:49:34,057 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.14 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 114.86 ms. Allocated memory is still 308.8 MB. Free memory was 218.2 MB in the beginning and 214.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 128.81 ms. Allocated memory is still 308.8 MB. Free memory was 214.3 MB in the beginning and 211.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 3515.12 ms. Allocated memory was 308.8 MB in the beginning and 330.8 MB in the end (delta: 22.0 MB). Free memory was 211.3 MB in the beginning and 226.2 MB in the end (delta: -14.9 MB). Peak memory consumption was 29.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 47971.44 ms. Allocated memory was 330.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 226.2 MB in the beginning and 840.3 MB in the end (delta: -614.1 MB). Peak memory consumption was 593.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 analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 262 locations, 1 error locations. TIMEOUT Result, 47.8s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 38.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7769 SDtfs, 5200 SDslu, 11021 SDs, 0 SdLazy, 10612 SolverSat, 6188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 563 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2293occurred in iteration=15, 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: 5.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 2214 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1300 NumberOfCodeBlocks, 1300 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1279 ConstructedInterpolants, 0 QuantifiedInterpolants, 143351 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1682 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 897/965 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/kmp.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-49-34-083.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/kmp.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-49-34-083.csv Completed graceful shutdown