java -Xss4m -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/eldarica-misc/LIA/reve/001-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:03:15,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:03:15,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:03:15,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:03:15,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:03:15,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:03:15,343 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:03:15,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:03:15,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:03:15,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:03:15,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:03:15,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:03:15,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:03:15,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:03:15,356 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:03:15,359 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:03:15,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:03:15,374 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:03:15,375 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:03:15,376 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:03:15,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:03:15,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:03:15,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:03:15,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:03:15,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:03:15,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:03:15,382 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:03:15,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:03:15,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:03:15,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:03:15,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:03:15,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:03:15,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:03:15,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:03:15,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:03:15,397 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:03:15,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:03:15,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:03:15,424 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:03:15,424 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:03:15,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:03:15,425 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:03:15,425 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:03:15,426 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:03:15,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:03:15,426 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:03:15,426 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:03:15,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:03:15,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:03:15,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:03:15,428 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:03:15,428 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:03:15,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:03:15,429 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:03:15,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:03:15,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:03:15,429 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:03:15,431 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:03:15,431 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:03:15,474 INFO ]: Repository-Root is: /tmp [2018-06-25 09:03:15,493 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:03:15,498 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:03:15,499 INFO ]: Initializing SmtParser... [2018-06-25 09:03:15,499 INFO ]: SmtParser initialized [2018-06-25 09:03:15,500 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/001-horn.smt2 [2018-06-25 09:03:15,501 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:03:15,590 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/001-horn.smt2 unknown [2018-06-25 09:03:15,930 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/001-horn.smt2 [2018-06-25 09:03:15,935 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:03:15,940 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:03:15,940 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:03:15,940 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:03:15,940 INFO ]: ChcToBoogie initialized [2018-06-25 09:03:15,950 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:03:15" (1/1) ... [2018-06-25 09:03:16,032 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:16 Unit [2018-06-25 09:03:16,032 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:03:16,033 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:03:16,033 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:03:16,033 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:03:16,050 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:16" (1/1) ... [2018-06-25 09:03:16,050 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:16" (1/1) ... [2018-06-25 09:03:16,058 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:16" (1/1) ... [2018-06-25 09:03:16,058 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:16" (1/1) ... [2018-06-25 09:03:16,075 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:16" (1/1) ... [2018-06-25 09:03:16,079 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:16" (1/1) ... [2018-06-25 09:03:16,087 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:16" (1/1) ... [2018-06-25 09:03:16,090 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:03:16,091 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:03:16,091 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:03:16,091 INFO ]: RCFGBuilder initialized [2018-06-25 09:03:16,092 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:03:16,114 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:03:16,114 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:03:16,114 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:03:16,114 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:03:16,114 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:03:16,114 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:03:17,108 INFO ]: Using library mode [2018-06-25 09:03:17,109 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:03:17 BoogieIcfgContainer [2018-06-25 09:03:17,109 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:03:17,111 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:03:17,111 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:03:17,114 INFO ]: TraceAbstraction initialized [2018-06-25 09:03:17,114 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:03:15" (1/3) ... [2018-06-25 09:03:17,115 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2957f3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:03:17, skipping insertion in model container [2018-06-25 09:03:17,115 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:16" (2/3) ... [2018-06-25 09:03:17,115 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2957f3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:03:17, skipping insertion in model container [2018-06-25 09:03:17,115 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:03:17" (3/3) ... [2018-06-25 09:03:17,119 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:03:17,128 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:03:17,138 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:03:17,173 INFO ]: Using default assertion order modulation [2018-06-25 09:03:17,173 INFO ]: Interprodecural is true [2018-06-25 09:03:17,173 INFO ]: Hoare is false [2018-06-25 09:03:17,173 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:03:17,173 INFO ]: Backedges is TWOTRACK [2018-06-25 09:03:17,173 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:03:17,173 INFO ]: Difference is false [2018-06-25 09:03:17,173 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:03:17,173 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:03:17,190 INFO ]: Start isEmpty. Operand 79 states. [2018-06-25 09:03:17,205 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:03:17,205 INFO ]: Found error trace [2018-06-25 09:03:17,206 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:17,206 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:17,213 INFO ]: Analyzing trace with hash -835644654, now seen corresponding path program 1 times [2018-06-25 09:03:17,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:17,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:17,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:17,256 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:17,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:17,285 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:17,403 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:17,405 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:17,406 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:17,407 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:17,423 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:17,423 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:17,425 INFO ]: Start difference. First operand 79 states. Second operand 4 states. [2018-06-25 09:03:18,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:18,504 INFO ]: Finished difference Result 111 states and 219 transitions. [2018-06-25 09:03:18,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:03:18,506 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-25 09:03:18,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:18,520 INFO ]: With dead ends: 111 [2018-06-25 09:03:18,521 INFO ]: Without dead ends: 111 [2018-06-25 09:03:18,522 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-25 09:03:18,535 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-25 09:03:18,584 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-06-25 09:03:18,587 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-25 09:03:18,592 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 219 transitions. [2018-06-25 09:03:18,594 INFO ]: Start accepts. Automaton has 111 states and 219 transitions. Word has length 7 [2018-06-25 09:03:18,595 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:18,595 INFO ]: Abstraction has 111 states and 219 transitions. [2018-06-25 09:03:18,595 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:18,595 INFO ]: Start isEmpty. Operand 111 states and 219 transitions. [2018-06-25 09:03:18,599 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:03:18,599 INFO ]: Found error trace [2018-06-25 09:03:18,599 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:18,599 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:18,599 INFO ]: Analyzing trace with hash -305262633, now seen corresponding path program 1 times [2018-06-25 09:03:18,599 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:18,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:18,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:18,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:18,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:18,605 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:18,745 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:18,745 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:18,745 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:18,747 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:18,747 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:18,747 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:18,747 INFO ]: Start difference. First operand 111 states and 219 transitions. Second operand 4 states. [2018-06-25 09:03:19,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:19,532 INFO ]: Finished difference Result 165 states and 327 transitions. [2018-06-25 09:03:19,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:03:19,532 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:03:19,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:19,539 INFO ]: With dead ends: 165 [2018-06-25 09:03:19,539 INFO ]: Without dead ends: 165 [2018-06-25 09:03:19,539 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 09:03:19,540 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-25 09:03:19,564 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-06-25 09:03:19,564 INFO ]: Start removeUnreachable. Operand 165 states. [2018-06-25 09:03:19,569 INFO ]: Finished removeUnreachable. Reduced from 165 states to 165 states and 327 transitions. [2018-06-25 09:03:19,569 INFO ]: Start accepts. Automaton has 165 states and 327 transitions. Word has length 8 [2018-06-25 09:03:19,569 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:19,570 INFO ]: Abstraction has 165 states and 327 transitions. [2018-06-25 09:03:19,570 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:19,570 INFO ]: Start isEmpty. Operand 165 states and 327 transitions. [2018-06-25 09:03:19,578 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:03:19,578 INFO ]: Found error trace [2018-06-25 09:03:19,578 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:19,578 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:19,578 INFO ]: Analyzing trace with hash -1018503054, now seen corresponding path program 1 times [2018-06-25 09:03:19,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:19,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:19,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:19,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:19,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:19,584 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:19,649 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:19,649 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:19,649 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:19,649 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:19,649 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:19,649 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:19,649 INFO ]: Start difference. First operand 165 states and 327 transitions. Second operand 4 states. [2018-06-25 09:03:19,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:19,968 INFO ]: Finished difference Result 219 states and 435 transitions. [2018-06-25 09:03:19,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:03:19,968 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:03:19,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:19,974 INFO ]: With dead ends: 219 [2018-06-25 09:03:19,974 INFO ]: Without dead ends: 219 [2018-06-25 09:03:19,975 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-25 09:03:19,975 INFO ]: Start minimizeSevpa. Operand 219 states. [2018-06-25 09:03:20,000 INFO ]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-06-25 09:03:20,000 INFO ]: Start removeUnreachable. Operand 219 states. [2018-06-25 09:03:20,005 INFO ]: Finished removeUnreachable. Reduced from 219 states to 219 states and 435 transitions. [2018-06-25 09:03:20,005 INFO ]: Start accepts. Automaton has 219 states and 435 transitions. Word has length 9 [2018-06-25 09:03:20,005 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:20,005 INFO ]: Abstraction has 219 states and 435 transitions. [2018-06-25 09:03:20,005 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:20,005 INFO ]: Start isEmpty. Operand 219 states and 435 transitions. [2018-06-25 09:03:20,012 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:03:20,012 INFO ]: Found error trace [2018-06-25 09:03:20,012 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:20,012 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:20,012 INFO ]: Analyzing trace with hash -1507130831, now seen corresponding path program 1 times [2018-06-25 09:03:20,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:20,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:20,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:20,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:20,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:20,027 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:20,216 WARN ]: Spent 132.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 8 [2018-06-25 09:03:20,216 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:20,245 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:20,245 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:03:20,245 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:03:20,245 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:03:20,245 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:20,246 INFO ]: Start difference. First operand 219 states and 435 transitions. Second operand 3 states. [2018-06-25 09:03:20,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:20,758 INFO ]: Finished difference Result 367 states and 880 transitions. [2018-06-25 09:03:20,759 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:03:20,759 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 09:03:20,759 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:20,779 INFO ]: With dead ends: 367 [2018-06-25 09:03:20,779 INFO ]: Without dead ends: 367 [2018-06-25 09:03:20,779 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:20,780 INFO ]: Start minimizeSevpa. Operand 367 states. [2018-06-25 09:03:20,827 INFO ]: Finished minimizeSevpa. Reduced states from 367 to 223. [2018-06-25 09:03:20,827 INFO ]: Start removeUnreachable. Operand 223 states. [2018-06-25 09:03:20,836 INFO ]: Finished removeUnreachable. Reduced from 223 states to 223 states and 495 transitions. [2018-06-25 09:03:20,836 INFO ]: Start accepts. Automaton has 223 states and 495 transitions. Word has length 10 [2018-06-25 09:03:20,836 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:20,836 INFO ]: Abstraction has 223 states and 495 transitions. [2018-06-25 09:03:20,836 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:03:20,836 INFO ]: Start isEmpty. Operand 223 states and 495 transitions. [2018-06-25 09:03:20,845 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:03:20,845 INFO ]: Found error trace [2018-06-25 09:03:20,845 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:20,845 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:20,845 INFO ]: Analyzing trace with hash 515893101, now seen corresponding path program 1 times [2018-06-25 09:03:20,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:20,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:20,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:20,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:20,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:20,865 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:20,993 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:20,993 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:20,993 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:03:20,994 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:03:20,994 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:03:20,994 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:20,994 INFO ]: Start difference. First operand 223 states and 495 transitions. Second operand 3 states. [2018-06-25 09:03:21,231 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:21,231 INFO ]: Finished difference Result 268 states and 740 transitions. [2018-06-25 09:03:21,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:03:21,232 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 09:03:21,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:21,238 INFO ]: With dead ends: 268 [2018-06-25 09:03:21,238 INFO ]: Without dead ends: 268 [2018-06-25 09:03:21,239 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:21,239 INFO ]: Start minimizeSevpa. Operand 268 states. [2018-06-25 09:03:21,264 INFO ]: Finished minimizeSevpa. Reduced states from 268 to 227. [2018-06-25 09:03:21,264 INFO ]: Start removeUnreachable. Operand 227 states. [2018-06-25 09:03:21,268 INFO ]: Finished removeUnreachable. Reduced from 227 states to 227 states and 567 transitions. [2018-06-25 09:03:21,268 INFO ]: Start accepts. Automaton has 227 states and 567 transitions. Word has length 11 [2018-06-25 09:03:21,268 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:21,268 INFO ]: Abstraction has 227 states and 567 transitions. [2018-06-25 09:03:21,268 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:03:21,268 INFO ]: Start isEmpty. Operand 227 states and 567 transitions. [2018-06-25 09:03:21,274 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:03:21,274 INFO ]: Found error trace [2018-06-25 09:03:21,274 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:21,274 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:21,274 INFO ]: Analyzing trace with hash 485387117, now seen corresponding path program 1 times [2018-06-25 09:03:21,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:21,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:21,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:21,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:21,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:21,283 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:21,323 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:21,323 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:21,323 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:03:21,323 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:03:21,323 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:03:21,323 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:21,323 INFO ]: Start difference. First operand 227 states and 567 transitions. Second operand 3 states. [2018-06-25 09:03:21,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:21,438 INFO ]: Finished difference Result 331 states and 840 transitions. [2018-06-25 09:03:21,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:03:21,441 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 09:03:21,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:21,451 INFO ]: With dead ends: 331 [2018-06-25 09:03:21,451 INFO ]: Without dead ends: 331 [2018-06-25 09:03:21,451 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:21,451 INFO ]: Start minimizeSevpa. Operand 331 states. [2018-06-25 09:03:21,476 INFO ]: Finished minimizeSevpa. Reduced states from 331 to 227. [2018-06-25 09:03:21,476 INFO ]: Start removeUnreachable. Operand 227 states. [2018-06-25 09:03:21,479 INFO ]: Finished removeUnreachable. Reduced from 227 states to 227 states and 535 transitions. [2018-06-25 09:03:21,480 INFO ]: Start accepts. Automaton has 227 states and 535 transitions. Word has length 11 [2018-06-25 09:03:21,480 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:21,480 INFO ]: Abstraction has 227 states and 535 transitions. [2018-06-25 09:03:21,480 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:03:21,480 INFO ]: Start isEmpty. Operand 227 states and 535 transitions. [2018-06-25 09:03:21,492 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:03:21,492 INFO ]: Found error trace [2018-06-25 09:03:21,492 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:21,493 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:21,493 INFO ]: Analyzing trace with hash 3928100, now seen corresponding path program 1 times [2018-06-25 09:03:21,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:21,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:21,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:21,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:21,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:21,502 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:21,548 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:03:21,548 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:21,548 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:21,549 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:21,549 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:21,549 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:21,549 INFO ]: Start difference. First operand 227 states and 535 transitions. Second operand 4 states. [2018-06-25 09:03:21,668 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:21,668 INFO ]: Finished difference Result 254 states and 715 transitions. [2018-06-25 09:03:21,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:03:21,669 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-25 09:03:21,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:21,675 INFO ]: With dead ends: 254 [2018-06-25 09:03:21,676 INFO ]: Without dead ends: 254 [2018-06-25 09:03:21,676 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-25 09:03:21,676 INFO ]: Start minimizeSevpa. Operand 254 states. [2018-06-25 09:03:21,695 INFO ]: Finished minimizeSevpa. Reduced states from 254 to 231. [2018-06-25 09:03:21,695 INFO ]: Start removeUnreachable. Operand 231 states. [2018-06-25 09:03:21,699 INFO ]: Finished removeUnreachable. Reduced from 231 states to 231 states and 583 transitions. [2018-06-25 09:03:21,699 INFO ]: Start accepts. Automaton has 231 states and 583 transitions. Word has length 18 [2018-06-25 09:03:21,699 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:21,699 INFO ]: Abstraction has 231 states and 583 transitions. [2018-06-25 09:03:21,699 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:21,699 INFO ]: Start isEmpty. Operand 231 states and 583 transitions. [2018-06-25 09:03:21,714 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:03:21,714 INFO ]: Found error trace [2018-06-25 09:03:21,714 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:21,714 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:21,715 INFO ]: Analyzing trace with hash 666463173, now seen corresponding path program 1 times [2018-06-25 09:03:21,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:21,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:21,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:21,715 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:21,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:21,724 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:21,809 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:03:21,809 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:21,809 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:21,810 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:21,810 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:21,810 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:21,810 INFO ]: Start difference. First operand 231 states and 583 transitions. Second operand 4 states. [2018-06-25 09:03:21,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:21,960 INFO ]: Finished difference Result 255 states and 759 transitions. [2018-06-25 09:03:21,960 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:03:21,960 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-25 09:03:21,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:21,967 INFO ]: With dead ends: 255 [2018-06-25 09:03:21,967 INFO ]: Without dead ends: 255 [2018-06-25 09:03:21,967 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-25 09:03:21,967 INFO ]: Start minimizeSevpa. Operand 255 states. [2018-06-25 09:03:21,983 INFO ]: Finished minimizeSevpa. Reduced states from 255 to 241. [2018-06-25 09:03:21,983 INFO ]: Start removeUnreachable. Operand 241 states. [2018-06-25 09:03:21,988 INFO ]: Finished removeUnreachable. Reduced from 241 states to 241 states and 651 transitions. [2018-06-25 09:03:21,988 INFO ]: Start accepts. Automaton has 241 states and 651 transitions. Word has length 18 [2018-06-25 09:03:21,988 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:21,988 INFO ]: Abstraction has 241 states and 651 transitions. [2018-06-25 09:03:21,988 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:21,988 INFO ]: Start isEmpty. Operand 241 states and 651 transitions. [2018-06-25 09:03:22,004 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:03:22,005 INFO ]: Found error trace [2018-06-25 09:03:22,005 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:22,005 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:22,005 INFO ]: Analyzing trace with hash 114079706, now seen corresponding path program 1 times [2018-06-25 09:03:22,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:22,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:22,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:22,006 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:22,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:22,013 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:22,147 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:03:22,147 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:22,147 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:22,148 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:22,148 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:22,148 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:22,148 INFO ]: Start difference. First operand 241 states and 651 transitions. Second operand 4 states. [2018-06-25 09:03:22,529 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:22,529 INFO ]: Finished difference Result 259 states and 795 transitions. [2018-06-25 09:03:22,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:03:22,529 INFO ]: Start accepts. Automaton has 4 states. Word has length 19 [2018-06-25 09:03:22,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:22,535 INFO ]: With dead ends: 259 [2018-06-25 09:03:22,535 INFO ]: Without dead ends: 259 [2018-06-25 09:03:22,535 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-25 09:03:22,535 INFO ]: Start minimizeSevpa. Operand 259 states. [2018-06-25 09:03:22,550 INFO ]: Finished minimizeSevpa. Reduced states from 259 to 241. [2018-06-25 09:03:22,550 INFO ]: Start removeUnreachable. Operand 241 states. [2018-06-25 09:03:22,555 INFO ]: Finished removeUnreachable. Reduced from 241 states to 241 states and 651 transitions. [2018-06-25 09:03:22,556 INFO ]: Start accepts. Automaton has 241 states and 651 transitions. Word has length 19 [2018-06-25 09:03:22,556 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:22,556 INFO ]: Abstraction has 241 states and 651 transitions. [2018-06-25 09:03:22,556 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:22,556 INFO ]: Start isEmpty. Operand 241 states and 651 transitions. [2018-06-25 09:03:22,570 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:03:22,570 INFO ]: Found error trace [2018-06-25 09:03:22,570 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:22,570 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:22,570 INFO ]: Analyzing trace with hash 42194023, now seen corresponding path program 1 times [2018-06-25 09:03:22,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:22,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:22,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:22,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:22,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:22,580 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:22,811 INFO ]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:03:22,811 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:22,811 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:03:22,811 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:03:22,811 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:03:22,811 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:03:22,812 INFO ]: Start difference. First operand 241 states and 651 transitions. Second operand 5 states. [2018-06-25 09:03:23,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:23,716 INFO ]: Finished difference Result 414 states and 1365 transitions. [2018-06-25 09:03:23,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:03:23,716 INFO ]: Start accepts. Automaton has 5 states. Word has length 19 [2018-06-25 09:03:23,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:23,743 INFO ]: With dead ends: 414 [2018-06-25 09:03:23,743 INFO ]: Without dead ends: 405 [2018-06-25 09:03:23,743 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:03:23,744 INFO ]: Start minimizeSevpa. Operand 405 states. [2018-06-25 09:03:23,780 INFO ]: Finished minimizeSevpa. Reduced states from 405 to 300. [2018-06-25 09:03:23,780 INFO ]: Start removeUnreachable. Operand 300 states. [2018-06-25 09:03:23,785 INFO ]: Finished removeUnreachable. Reduced from 300 states to 300 states and 836 transitions. [2018-06-25 09:03:23,785 INFO ]: Start accepts. Automaton has 300 states and 836 transitions. Word has length 19 [2018-06-25 09:03:23,785 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:23,786 INFO ]: Abstraction has 300 states and 836 transitions. [2018-06-25 09:03:23,786 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:03:23,786 INFO ]: Start isEmpty. Operand 300 states and 836 transitions. [2018-06-25 09:03:23,808 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:03:23,808 INFO ]: Found error trace [2018-06-25 09:03:23,808 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:23,809 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:23,809 INFO ]: Analyzing trace with hash -808346487, now seen corresponding path program 1 times [2018-06-25 09:03:23,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:23,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:23,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:23,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:23,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:23,817 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:23,936 INFO ]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:03:23,936 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:23,936 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:23,937 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:23,937 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:23,937 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:23,937 INFO ]: Start difference. First operand 300 states and 836 transitions. Second operand 4 states. [2018-06-25 09:03:24,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:24,471 INFO ]: Finished difference Result 436 states and 1486 transitions. [2018-06-25 09:03:24,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:03:24,471 INFO ]: Start accepts. Automaton has 4 states. Word has length 19 [2018-06-25 09:03:24,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:24,477 INFO ]: With dead ends: 436 [2018-06-25 09:03:24,477 INFO ]: Without dead ends: 267 [2018-06-25 09:03:24,478 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-25 09:03:24,478 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-25 09:03:24,499 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 236. [2018-06-25 09:03:24,499 INFO ]: Start removeUnreachable. Operand 236 states. [2018-06-25 09:03:24,501 INFO ]: Finished removeUnreachable. Reduced from 236 states to 236 states and 602 transitions. [2018-06-25 09:03:24,502 INFO ]: Start accepts. Automaton has 236 states and 602 transitions. Word has length 19 [2018-06-25 09:03:24,502 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:24,502 INFO ]: Abstraction has 236 states and 602 transitions. [2018-06-25 09:03:24,502 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:24,502 INFO ]: Start isEmpty. Operand 236 states and 602 transitions. [2018-06-25 09:03:24,512 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:03:24,512 INFO ]: Found error trace [2018-06-25 09:03:24,512 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:24,512 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:24,512 INFO ]: Analyzing trace with hash 525242505, now seen corresponding path program 1 times [2018-06-25 09:03:24,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:24,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:24,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:24,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:24,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:24,520 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:24,794 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:03:24,794 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:24,794 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 09:03:24,794 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:03:24,794 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:03:24,794 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:03:24,794 INFO ]: Start difference. First operand 236 states and 602 transitions. Second operand 6 states. [2018-06-25 09:03:25,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:25,471 INFO ]: Finished difference Result 372 states and 1052 transitions. [2018-06-25 09:03:25,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:03:25,528 INFO ]: Start accepts. Automaton has 6 states. Word has length 19 [2018-06-25 09:03:25,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:25,533 INFO ]: With dead ends: 372 [2018-06-25 09:03:25,534 INFO ]: Without dead ends: 365 [2018-06-25 09:03:25,534 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:03:25,534 INFO ]: Start minimizeSevpa. Operand 365 states. [2018-06-25 09:03:25,565 INFO ]: Finished minimizeSevpa. Reduced states from 365 to 274. [2018-06-25 09:03:25,565 INFO ]: Start removeUnreachable. Operand 274 states. [2018-06-25 09:03:25,568 INFO ]: Finished removeUnreachable. Reduced from 274 states to 274 states and 727 transitions. [2018-06-25 09:03:25,568 INFO ]: Start accepts. Automaton has 274 states and 727 transitions. Word has length 19 [2018-06-25 09:03:25,568 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:25,568 INFO ]: Abstraction has 274 states and 727 transitions. [2018-06-25 09:03:25,568 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:03:25,568 INFO ]: Start isEmpty. Operand 274 states and 727 transitions. [2018-06-25 09:03:25,577 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:03:25,577 INFO ]: Found error trace [2018-06-25 09:03:25,577 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:25,577 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:25,577 INFO ]: Analyzing trace with hash -671679881, now seen corresponding path program 1 times [2018-06-25 09:03:25,577 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:25,577 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:25,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:25,578 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:25,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:25,589 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:25,917 WARN ]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-25 09:03:26,061 INFO ]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:03:26,061 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:26,061 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:26,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:26,123 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:26,131 INFO ]: Computing forward predicates... [2018-06-25 09:03:26,422 INFO ]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:03:26,458 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:26,458 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-25 09:03:26,458 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:03:26,459 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:03:26,459 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:03:26,459 INFO ]: Start difference. First operand 274 states and 727 transitions. Second operand 11 states. [2018-06-25 09:03:27,300 WARN ]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-25 09:03:29,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:29,194 INFO ]: Finished difference Result 624 states and 2285 transitions. [2018-06-25 09:03:29,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:03:29,194 INFO ]: Start accepts. Automaton has 11 states. Word has length 19 [2018-06-25 09:03:29,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:29,227 INFO ]: With dead ends: 624 [2018-06-25 09:03:29,227 INFO ]: Without dead ends: 616 [2018-06-25 09:03:29,227 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:03:29,228 INFO ]: Start minimizeSevpa. Operand 616 states. [2018-06-25 09:03:29,315 INFO ]: Finished minimizeSevpa. Reduced states from 616 to 348. [2018-06-25 09:03:29,316 INFO ]: Start removeUnreachable. Operand 348 states. [2018-06-25 09:03:29,320 INFO ]: Finished removeUnreachable. Reduced from 348 states to 348 states and 990 transitions. [2018-06-25 09:03:29,320 INFO ]: Start accepts. Automaton has 348 states and 990 transitions. Word has length 19 [2018-06-25 09:03:29,321 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:29,321 INFO ]: Abstraction has 348 states and 990 transitions. [2018-06-25 09:03:29,321 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:03:29,321 INFO ]: Start isEmpty. Operand 348 states and 990 transitions. [2018-06-25 09:03:29,335 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:03:29,335 INFO ]: Found error trace [2018-06-25 09:03:29,335 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:29,335 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:29,335 INFO ]: Analyzing trace with hash 169113260, now seen corresponding path program 1 times [2018-06-25 09:03:29,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:29,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:29,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:29,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:29,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:29,346 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:29,495 INFO ]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:03:29,495 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:29,495 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:29,495 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:29,496 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:29,496 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:29,496 INFO ]: Start difference. First operand 348 states and 990 transitions. Second operand 4 states. [2018-06-25 09:03:29,995 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:29,995 INFO ]: Finished difference Result 368 states and 1024 transitions. [2018-06-25 09:03:29,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:03:29,995 INFO ]: Start accepts. Automaton has 4 states. Word has length 20 [2018-06-25 09:03:29,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:30,001 INFO ]: With dead ends: 368 [2018-06-25 09:03:30,001 INFO ]: Without dead ends: 348 [2018-06-25 09:03:30,001 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-25 09:03:30,001 INFO ]: Start minimizeSevpa. Operand 348 states. [2018-06-25 09:03:30,022 INFO ]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-06-25 09:03:30,022 INFO ]: Start removeUnreachable. Operand 348 states. [2018-06-25 09:03:30,026 INFO ]: Finished removeUnreachable. Reduced from 348 states to 348 states and 987 transitions. [2018-06-25 09:03:30,026 INFO ]: Start accepts. Automaton has 348 states and 987 transitions. Word has length 20 [2018-06-25 09:03:30,026 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:30,026 INFO ]: Abstraction has 348 states and 987 transitions. [2018-06-25 09:03:30,026 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:30,026 INFO ]: Start isEmpty. Operand 348 states and 987 transitions. [2018-06-25 09:03:30,041 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:03:30,041 INFO ]: Found error trace [2018-06-25 09:03:30,041 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:30,041 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:30,041 INFO ]: Analyzing trace with hash 421168288, now seen corresponding path program 1 times [2018-06-25 09:03:30,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:30,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:30,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:30,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:30,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:30,046 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:30,212 INFO ]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:03:30,212 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:30,212 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:30,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:30,246 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:30,247 INFO ]: Computing forward predicates... [2018-06-25 09:03:30,287 INFO ]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:03:30,319 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:03:30,319 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-06-25 09:03:30,319 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:03:30,319 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:03:30,319 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:03:30,319 INFO ]: Start difference. First operand 348 states and 987 transitions. Second operand 9 states. [2018-06-25 09:03:32,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:32,408 INFO ]: Finished difference Result 703 states and 2603 transitions. [2018-06-25 09:03:32,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:03:32,408 INFO ]: Start accepts. Automaton has 9 states. Word has length 20 [2018-06-25 09:03:32,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:32,430 INFO ]: With dead ends: 703 [2018-06-25 09:03:32,431 INFO ]: Without dead ends: 703 [2018-06-25 09:03:32,431 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:03:32,432 INFO ]: Start minimizeSevpa. Operand 703 states. [2018-06-25 09:03:32,514 INFO ]: Finished minimizeSevpa. Reduced states from 703 to 510. [2018-06-25 09:03:32,514 INFO ]: Start removeUnreachable. Operand 510 states. [2018-06-25 09:03:32,524 INFO ]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1478 transitions. [2018-06-25 09:03:32,524 INFO ]: Start accepts. Automaton has 510 states and 1478 transitions. Word has length 20 [2018-06-25 09:03:32,524 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:32,524 INFO ]: Abstraction has 510 states and 1478 transitions. [2018-06-25 09:03:32,524 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:03:32,524 INFO ]: Start isEmpty. Operand 510 states and 1478 transitions. [2018-06-25 09:03:32,535 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:03:32,535 INFO ]: Found error trace [2018-06-25 09:03:32,535 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:32,535 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:32,536 INFO ]: Analyzing trace with hash -1798566386, now seen corresponding path program 1 times [2018-06-25 09:03:32,536 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:32,536 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:32,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:32,536 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:32,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:32,548 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:32,903 WARN ]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-25 09:03:32,932 INFO ]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:03:32,932 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:32,932 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:32,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:32,957 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:32,962 INFO ]: Computing forward predicates... [2018-06-25 09:03:33,048 INFO ]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:03:33,066 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:33,067 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-25 09:03:33,067 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:03:33,067 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:03:33,067 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:03:33,067 INFO ]: Start difference. First operand 510 states and 1478 transitions. Second operand 10 states. [2018-06-25 09:03:34,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:34,610 INFO ]: Finished difference Result 820 states and 2980 transitions. [2018-06-25 09:03:34,611 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:03:34,611 INFO ]: Start accepts. Automaton has 10 states. Word has length 20 [2018-06-25 09:03:34,611 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:34,639 INFO ]: With dead ends: 820 [2018-06-25 09:03:34,639 INFO ]: Without dead ends: 820 [2018-06-25 09:03:34,639 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:03:34,640 INFO ]: Start minimizeSevpa. Operand 820 states. [2018-06-25 09:03:34,725 INFO ]: Finished minimizeSevpa. Reduced states from 820 to 535. [2018-06-25 09:03:34,725 INFO ]: Start removeUnreachable. Operand 535 states. [2018-06-25 09:03:34,734 INFO ]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1563 transitions. [2018-06-25 09:03:34,734 INFO ]: Start accepts. Automaton has 535 states and 1563 transitions. Word has length 20 [2018-06-25 09:03:34,734 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:34,734 INFO ]: Abstraction has 535 states and 1563 transitions. [2018-06-25 09:03:34,734 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:03:34,734 INFO ]: Start isEmpty. Operand 535 states and 1563 transitions. [2018-06-25 09:03:34,745 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:03:34,745 INFO ]: Found error trace [2018-06-25 09:03:34,745 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:34,746 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:34,746 INFO ]: Analyzing trace with hash 2007541559, now seen corresponding path program 1 times [2018-06-25 09:03:34,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:34,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:34,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:34,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:34,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:34,753 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:35,007 INFO ]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:03:35,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:35,007 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:35,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:35,041 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:35,043 INFO ]: Computing forward predicates... [2018-06-25 09:03:35,235 INFO ]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:03:35,262 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:03:35,262 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-06-25 09:03:35,262 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:03:35,262 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:03:35,262 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:03:35,262 INFO ]: Start difference. First operand 535 states and 1563 transitions. Second operand 10 states. [2018-06-25 09:03:37,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:37,732 INFO ]: Finished difference Result 1008 states and 4448 transitions. [2018-06-25 09:03:37,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:03:37,732 INFO ]: Start accepts. Automaton has 10 states. Word has length 20 [2018-06-25 09:03:37,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:37,785 INFO ]: With dead ends: 1008 [2018-06-25 09:03:37,785 INFO ]: Without dead ends: 1001 [2018-06-25 09:03:37,785 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:03:37,787 INFO ]: Start minimizeSevpa. Operand 1001 states. [2018-06-25 09:03:37,937 INFO ]: Finished minimizeSevpa. Reduced states from 1001 to 684. [2018-06-25 09:03:37,937 INFO ]: Start removeUnreachable. Operand 684 states. [2018-06-25 09:03:37,950 INFO ]: Finished removeUnreachable. Reduced from 684 states to 684 states and 2201 transitions. [2018-06-25 09:03:37,950 INFO ]: Start accepts. Automaton has 684 states and 2201 transitions. Word has length 20 [2018-06-25 09:03:37,951 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:37,951 INFO ]: Abstraction has 684 states and 2201 transitions. [2018-06-25 09:03:37,951 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:03:37,951 INFO ]: Start isEmpty. Operand 684 states and 2201 transitions. [2018-06-25 09:03:37,959 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:03:37,959 INFO ]: Found error trace [2018-06-25 09:03:37,959 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:37,959 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:37,960 INFO ]: Analyzing trace with hash 1710007095, now seen corresponding path program 1 times [2018-06-25 09:03:37,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:37,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:37,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:37,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:37,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:37,966 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:38,119 INFO ]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:03:38,119 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:38,119 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:38,125 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:38,156 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:38,158 INFO ]: Computing forward predicates... [2018-06-25 09:03:38,211 INFO ]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:03:38,230 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:03:38,230 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-06-25 09:03:38,230 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:03:38,230 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:03:38,230 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:03:38,230 INFO ]: Start difference. First operand 684 states and 2201 transitions. Second operand 10 states. [2018-06-25 09:03:40,173 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:40,173 INFO ]: Finished difference Result 1442 states and 7974 transitions. [2018-06-25 09:03:40,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:03:40,174 INFO ]: Start accepts. Automaton has 10 states. Word has length 20 [2018-06-25 09:03:40,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:40,241 INFO ]: With dead ends: 1442 [2018-06-25 09:03:40,241 INFO ]: Without dead ends: 1442 [2018-06-25 09:03:40,241 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:03:40,242 INFO ]: Start minimizeSevpa. Operand 1442 states. [2018-06-25 09:03:40,549 INFO ]: Finished minimizeSevpa. Reduced states from 1442 to 878. [2018-06-25 09:03:40,549 INFO ]: Start removeUnreachable. Operand 878 states. [2018-06-25 09:03:40,620 INFO ]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3076 transitions. [2018-06-25 09:03:40,620 INFO ]: Start accepts. Automaton has 878 states and 3076 transitions. Word has length 20 [2018-06-25 09:03:40,621 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:40,621 INFO ]: Abstraction has 878 states and 3076 transitions. [2018-06-25 09:03:40,621 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:03:40,621 INFO ]: Start isEmpty. Operand 878 states and 3076 transitions. [2018-06-25 09:03:40,629 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:03:40,629 INFO ]: Found error trace [2018-06-25 09:03:40,629 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:40,629 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:40,629 INFO ]: Analyzing trace with hash 1303329652, now seen corresponding path program 1 times [2018-06-25 09:03:40,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:40,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:40,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:40,630 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:40,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:40,637 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:40,747 INFO ]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:03:40,747 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:40,747 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:40,747 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:40,748 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:40,748 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:40,748 INFO ]: Start difference. First operand 878 states and 3076 transitions. Second operand 4 states. [2018-06-25 09:03:40,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:40,935 INFO ]: Finished difference Result 921 states and 3221 transitions. [2018-06-25 09:03:40,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:03:40,936 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-25 09:03:40,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:40,958 INFO ]: With dead ends: 921 [2018-06-25 09:03:40,958 INFO ]: Without dead ends: 877 [2018-06-25 09:03:40,958 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:03:40,958 INFO ]: Start minimizeSevpa. Operand 877 states. [2018-06-25 09:03:41,027 INFO ]: Finished minimizeSevpa. Reduced states from 877 to 877. [2018-06-25 09:03:41,027 INFO ]: Start removeUnreachable. Operand 877 states. [2018-06-25 09:03:41,053 INFO ]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3068 transitions. [2018-06-25 09:03:41,053 INFO ]: Start accepts. Automaton has 877 states and 3068 transitions. Word has length 21 [2018-06-25 09:03:41,053 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:41,053 INFO ]: Abstraction has 877 states and 3068 transitions. [2018-06-25 09:03:41,053 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:41,053 INFO ]: Start isEmpty. Operand 877 states and 3068 transitions. [2018-06-25 09:03:41,060 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:03:41,060 INFO ]: Found error trace [2018-06-25 09:03:41,060 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:41,060 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:41,060 INFO ]: Analyzing trace with hash 1616949240, now seen corresponding path program 1 times [2018-06-25 09:03:41,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:41,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:41,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:41,062 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:41,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:41,068 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:41,644 WARN ]: Spent 114.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-06-25 09:03:41,644 INFO ]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:03:41,644 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:41,644 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:41,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:41,672 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:41,674 INFO ]: Computing forward predicates... [2018-06-25 09:03:41,719 INFO ]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:03:41,740 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:41,740 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-25 09:03:41,740 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:03:41,740 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:03:41,741 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:03:41,741 INFO ]: Start difference. First operand 877 states and 3068 transitions. Second operand 11 states. [2018-06-25 09:03:45,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:45,606 INFO ]: Finished difference Result 2139 states and 16722 transitions. [2018-06-25 09:03:45,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-25 09:03:45,606 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-25 09:03:45,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:45,791 INFO ]: With dead ends: 2139 [2018-06-25 09:03:45,791 INFO ]: Without dead ends: 2139 [2018-06-25 09:03:45,792 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=463, Invalid=2729, Unknown=0, NotChecked=0, Total=3192 [2018-06-25 09:03:45,793 INFO ]: Start minimizeSevpa. Operand 2139 states. [2018-06-25 09:03:46,306 INFO ]: Finished minimizeSevpa. Reduced states from 2139 to 1004. [2018-06-25 09:03:46,307 INFO ]: Start removeUnreachable. Operand 1004 states. [2018-06-25 09:03:46,335 INFO ]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 3424 transitions. [2018-06-25 09:03:46,335 INFO ]: Start accepts. Automaton has 1004 states and 3424 transitions. Word has length 21 [2018-06-25 09:03:46,335 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:46,335 INFO ]: Abstraction has 1004 states and 3424 transitions. [2018-06-25 09:03:46,335 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:03:46,335 INFO ]: Start isEmpty. Operand 1004 states and 3424 transitions. [2018-06-25 09:03:46,340 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:03:46,340 INFO ]: Found error trace [2018-06-25 09:03:46,340 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:46,340 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:46,341 INFO ]: Analyzing trace with hash 1319414776, now seen corresponding path program 1 times [2018-06-25 09:03:46,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:46,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:46,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:46,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,347 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:46,417 INFO ]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:03:46,417 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:46,417 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-25 09:03:46,432 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:46,466 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:46,468 INFO ]: Computing forward predicates... [2018-06-25 09:03:46,523 INFO ]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:03:46,542 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:46,542 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-25 09:03:46,543 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:03:46,543 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:03:46,543 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:03:46,543 INFO ]: Start difference. First operand 1004 states and 3424 transitions. Second operand 11 states. [2018-06-25 09:03:52,383 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:52,384 INFO ]: Finished difference Result 2624 states and 16126 transitions. [2018-06-25 09:03:52,384 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-06-25 09:03:52,384 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-25 09:03:52,384 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:52,661 INFO ]: With dead ends: 2624 [2018-06-25 09:03:52,661 INFO ]: Without dead ends: 2624 [2018-06-25 09:03:52,662 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=4626, Unknown=0, NotChecked=0, Total=5256 [2018-06-25 09:03:52,663 INFO ]: Start minimizeSevpa. Operand 2624 states. [2018-06-25 09:03:52,979 INFO ]: Finished minimizeSevpa. Reduced states from 2624 to 1266. [2018-06-25 09:03:52,979 INFO ]: Start removeUnreachable. Operand 1266 states. [2018-06-25 09:03:53,007 INFO ]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4109 transitions. [2018-06-25 09:03:53,007 INFO ]: Start accepts. Automaton has 1266 states and 4109 transitions. Word has length 21 [2018-06-25 09:03:53,007 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:53,007 INFO ]: Abstraction has 1266 states and 4109 transitions. [2018-06-25 09:03:53,007 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:03:53,007 INFO ]: Start isEmpty. Operand 1266 states and 4109 transitions. [2018-06-25 09:03:53,019 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:03:53,019 INFO ]: Found error trace [2018-06-25 09:03:53,020 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:53,020 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:53,021 INFO ]: Analyzing trace with hash -838324583, now seen corresponding path program 1 times [2018-06-25 09:03:53,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:53,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:53,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:53,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:53,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:53,030 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:53,068 INFO ]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:03:53,068 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:53,068 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:53,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:53,090 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:53,091 INFO ]: Computing forward predicates... [2018-06-25 09:03:53,097 INFO ]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:03:53,116 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:53,116 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 09:03:53,116 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:03:53,116 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:03:53,116 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:03:53,117 INFO ]: Start difference. First operand 1266 states and 4109 transitions. Second operand 6 states. [2018-06-25 09:03:53,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:53,359 INFO ]: Finished difference Result 2073 states and 8806 transitions. [2018-06-25 09:03:53,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:03:53,361 INFO ]: Start accepts. Automaton has 6 states. Word has length 27 [2018-06-25 09:03:53,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:53,464 INFO ]: With dead ends: 2073 [2018-06-25 09:03:53,464 INFO ]: Without dead ends: 2073 [2018-06-25 09:03:53,465 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:03:53,466 INFO ]: Start minimizeSevpa. Operand 2073 states. [2018-06-25 09:03:53,664 INFO ]: Finished minimizeSevpa. Reduced states from 2073 to 1308. [2018-06-25 09:03:53,664 INFO ]: Start removeUnreachable. Operand 1308 states. [2018-06-25 09:03:53,687 INFO ]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 4273 transitions. [2018-06-25 09:03:53,687 INFO ]: Start accepts. Automaton has 1308 states and 4273 transitions. Word has length 27 [2018-06-25 09:03:53,687 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:53,687 INFO ]: Abstraction has 1308 states and 4273 transitions. [2018-06-25 09:03:53,687 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:03:53,687 INFO ]: Start isEmpty. Operand 1308 states and 4273 transitions. [2018-06-25 09:03:53,704 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:03:53,704 INFO ]: Found error trace [2018-06-25 09:03:53,704 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:53,704 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:53,704 INFO ]: Analyzing trace with hash 1068503451, now seen corresponding path program 1 times [2018-06-25 09:03:53,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:53,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:53,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:53,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:53,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:53,717 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:53,772 INFO ]: Checked inductivity of 19 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:03:53,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:53,772 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:53,777 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:53,795 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:53,797 INFO ]: Computing forward predicates... [2018-06-25 09:03:53,891 INFO ]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:03:53,910 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:53,910 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-25 09:03:53,910 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:03:53,910 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:03:53,911 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:03:53,911 INFO ]: Start difference. First operand 1308 states and 4273 transitions. Second operand 15 states. [2018-06-25 09:03:57,999 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:58,000 INFO ]: Finished difference Result 1966 states and 8694 transitions. [2018-06-25 09:03:58,000 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-25 09:03:58,000 INFO ]: Start accepts. Automaton has 15 states. Word has length 28 [2018-06-25 09:03:58,000 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:58,102 INFO ]: With dead ends: 1966 [2018-06-25 09:03:58,103 INFO ]: Without dead ends: 1966 [2018-06-25 09:03:58,104 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=474, Invalid=2948, Unknown=0, NotChecked=0, Total=3422 [2018-06-25 09:03:58,104 INFO ]: Start minimizeSevpa. Operand 1966 states. [2018-06-25 09:03:58,262 INFO ]: Finished minimizeSevpa. Reduced states from 1966 to 1339. [2018-06-25 09:03:58,262 INFO ]: Start removeUnreachable. Operand 1339 states. [2018-06-25 09:03:58,287 INFO ]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 4525 transitions. [2018-06-25 09:03:58,288 INFO ]: Start accepts. Automaton has 1339 states and 4525 transitions. Word has length 28 [2018-06-25 09:03:58,288 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:58,288 INFO ]: Abstraction has 1339 states and 4525 transitions. [2018-06-25 09:03:58,288 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:03:58,288 INFO ]: Start isEmpty. Operand 1339 states and 4525 transitions. [2018-06-25 09:03:58,298 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:03:58,298 INFO ]: Found error trace [2018-06-25 09:03:58,298 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:58,298 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:58,298 INFO ]: Analyzing trace with hash -1601692260, now seen corresponding path program 1 times [2018-06-25 09:03:58,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:58,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:58,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:58,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:58,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:58,307 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:58,347 INFO ]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:03:58,347 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:58,347 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:03:58,347 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:03:58,347 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:03:58,347 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:58,347 INFO ]: Start difference. First operand 1339 states and 4525 transitions. Second operand 3 states. [2018-06-25 09:03:58,451 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:58,451 INFO ]: Finished difference Result 1861 states and 6963 transitions. [2018-06-25 09:03:58,451 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:03:58,451 INFO ]: Start accepts. Automaton has 3 states. Word has length 29 [2018-06-25 09:03:58,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:58,547 INFO ]: With dead ends: 1861 [2018-06-25 09:03:58,547 INFO ]: Without dead ends: 1861 [2018-06-25 09:03:58,547 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:58,548 INFO ]: Start minimizeSevpa. Operand 1861 states. [2018-06-25 09:03:58,668 INFO ]: Finished minimizeSevpa. Reduced states from 1861 to 1298. [2018-06-25 09:03:58,668 INFO ]: Start removeUnreachable. Operand 1298 states. [2018-06-25 09:03:58,721 INFO ]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 4694 transitions. [2018-06-25 09:03:58,721 INFO ]: Start accepts. Automaton has 1298 states and 4694 transitions. Word has length 29 [2018-06-25 09:03:58,721 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:58,721 INFO ]: Abstraction has 1298 states and 4694 transitions. [2018-06-25 09:03:58,721 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:03:58,721 INFO ]: Start isEmpty. Operand 1298 states and 4694 transitions. [2018-06-25 09:03:58,741 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:03:58,741 INFO ]: Found error trace [2018-06-25 09:03:58,741 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:58,741 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:58,741 INFO ]: Analyzing trace with hash 1697514844, now seen corresponding path program 1 times [2018-06-25 09:03:58,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:58,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:58,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:58,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:58,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:58,750 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:58,809 INFO ]: Checked inductivity of 22 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:03:58,809 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:58,809 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:58,818 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:58,839 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:58,841 INFO ]: Computing forward predicates... [2018-06-25 09:03:59,019 INFO ]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:03:59,038 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:59,038 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-25 09:03:59,038 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:03:59,038 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:03:59,038 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:03:59,038 INFO ]: Start difference. First operand 1298 states and 4694 transitions. Second operand 16 states. [2018-06-25 09:04:04,129 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 09:04:07,808 WARN ]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-25 09:04:11,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:11,439 INFO ]: Finished difference Result 3476 states and 23508 transitions. [2018-06-25 09:04:11,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-06-25 09:04:11,439 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-25 09:04:11,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:11,802 INFO ]: With dead ends: 3476 [2018-06-25 09:04:11,802 INFO ]: Without dead ends: 3476 [2018-06-25 09:04:11,805 INFO ]: 0 DeclaredPredicates, 180 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5757 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1542, Invalid=14460, Unknown=0, NotChecked=0, Total=16002 [2018-06-25 09:04:11,806 INFO ]: Start minimizeSevpa. Operand 3476 states. [2018-06-25 09:04:12,382 INFO ]: Finished minimizeSevpa. Reduced states from 3476 to 1333. [2018-06-25 09:04:12,382 INFO ]: Start removeUnreachable. Operand 1333 states. [2018-06-25 09:04:12,411 INFO ]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 4784 transitions. [2018-06-25 09:04:12,411 INFO ]: Start accepts. Automaton has 1333 states and 4784 transitions. Word has length 29 [2018-06-25 09:04:12,411 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:12,411 INFO ]: Abstraction has 1333 states and 4784 transitions. [2018-06-25 09:04:12,411 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:04:12,411 INFO ]: Start isEmpty. Operand 1333 states and 4784 transitions. [2018-06-25 09:04:12,426 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:04:12,426 INFO ]: Found error trace [2018-06-25 09:04:12,426 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:12,426 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:12,427 INFO ]: Analyzing trace with hash 1853340464, now seen corresponding path program 1 times [2018-06-25 09:04:12,427 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:12,427 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:12,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:12,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:12,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:12,436 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:12,473 INFO ]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:04:12,473 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:12,473 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:12,479 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:12,497 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:12,499 INFO ]: Computing forward predicates... [2018-06-25 09:04:12,503 INFO ]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:04:12,523 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:12,523 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-25 09:04:12,523 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:04:12,523 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:04:12,523 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:04:12,523 INFO ]: Start difference. First operand 1333 states and 4784 transitions. Second operand 7 states. [2018-06-25 09:04:12,894 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:12,894 INFO ]: Finished difference Result 2025 states and 10394 transitions. [2018-06-25 09:04:12,895 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:04:12,895 INFO ]: Start accepts. Automaton has 7 states. Word has length 28 [2018-06-25 09:04:12,895 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:13,040 INFO ]: With dead ends: 2025 [2018-06-25 09:04:13,040 INFO ]: Without dead ends: 2025 [2018-06-25 09:04:13,041 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:04:13,041 INFO ]: Start minimizeSevpa. Operand 2025 states. [2018-06-25 09:04:13,179 INFO ]: Finished minimizeSevpa. Reduced states from 2025 to 1450. [2018-06-25 09:04:13,179 INFO ]: Start removeUnreachable. Operand 1450 states. [2018-06-25 09:04:13,217 INFO ]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5288 transitions. [2018-06-25 09:04:13,217 INFO ]: Start accepts. Automaton has 1450 states and 5288 transitions. Word has length 28 [2018-06-25 09:04:13,217 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:13,217 INFO ]: Abstraction has 1450 states and 5288 transitions. [2018-06-25 09:04:13,217 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:04:13,217 INFO ]: Start isEmpty. Operand 1450 states and 5288 transitions. [2018-06-25 09:04:13,235 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:04:13,235 INFO ]: Found error trace [2018-06-25 09:04:13,235 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:13,235 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:13,235 INFO ]: Analyzing trace with hash 1891439665, now seen corresponding path program 1 times [2018-06-25 09:04:13,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:13,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:13,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:13,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:13,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:13,244 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:13,483 INFO ]: Checked inductivity of 25 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:04:13,483 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:13,483 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:13,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:13,509 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:13,512 INFO ]: Computing forward predicates... [2018-06-25 09:04:13,624 INFO ]: Checked inductivity of 25 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:04:13,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:13,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2018-06-25 09:04:13,645 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:04:13,645 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:04:13,645 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:04:13,645 INFO ]: Start difference. First operand 1450 states and 5288 transitions. Second operand 13 states. Received shutdown request... [2018-06-25 09:04:14,857 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:04:14,857 WARN ]: Verification canceled [2018-06-25 09:04:14,861 WARN ]: Timeout [2018-06-25 09:04:14,861 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:04:14 BoogieIcfgContainer [2018-06-25 09:04:14,861 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:04:14,862 INFO ]: Toolchain (without parser) took 58926.75 ms. Allocated memory was 307.8 MB in the beginning and 1.3 GB in the end (delta: 969.9 MB). Free memory was 254.2 MB in the beginning and 274.1 MB in the end (delta: -19.9 MB). Peak memory consumption was 950.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:14,862 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:04:14,863 INFO ]: ChcToBoogie took 92.09 ms. Allocated memory is still 307.8 MB. Free memory was 254.2 MB in the beginning and 251.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:14,863 INFO ]: Boogie Preprocessor took 57.48 ms. Allocated memory is still 307.8 MB. Free memory was 251.2 MB in the beginning and 249.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:14,863 INFO ]: RCFGBuilder took 1018.42 ms. Allocated memory is still 307.8 MB. Free memory was 249.1 MB in the beginning and 213.1 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:14,864 INFO ]: TraceAbstraction took 57750.56 ms. Allocated memory was 307.8 MB in the beginning and 1.3 GB in the end (delta: 969.9 MB). Free memory was 213.1 MB in the beginning and 274.1 MB in the end (delta: -61.0 MB). Peak memory consumption was 908.9 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:14,866 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 92.09 ms. Allocated memory is still 307.8 MB. Free memory was 254.2 MB in the beginning and 251.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 57.48 ms. Allocated memory is still 307.8 MB. Free memory was 251.2 MB in the beginning and 249.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1018.42 ms. Allocated memory is still 307.8 MB. Free memory was 249.1 MB in the beginning and 213.1 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57750.56 ms. Allocated memory was 307.8 MB in the beginning and 1.3 GB in the end (delta: 969.9 MB). Free memory was 213.1 MB in the beginning and 274.1 MB in the end (delta: -61.0 MB). Peak memory consumption was 908.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 (1450states) and interpolant automaton (currently 19 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (1952 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. TIMEOUT Result, 57.6s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 47.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6744 SDtfs, 4397 SDslu, 25106 SDs, 0 SdLazy, 42618 SolverSat, 6621 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 853 GetRequests, 358 SyntacticMatches, 10 SemanticMatches, 485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9815 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1450occurred in iteration=26, 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: 3.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 9364 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 800 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 761 ConstructedInterpolants, 0 QuantifiedInterpolants, 42060 SizeOfPredicates, 88 NumberOfNonLiveVariables, 2060 ConjunctsInSsa, 249 ConjunctsInUnsatCore, 39 InterpolantComputations, 18 PerfectInterpolantSequences, 356/411 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/001-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-04-14-875.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/001-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-04-14-875.csv Completed graceful shutdown