java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/001-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:07:37,332 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:07:37,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:07:37,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:07:37,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:07:37,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:07:37,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:07:37,354 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:07:37,355 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:07:37,357 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:07:37,358 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:07:37,358 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:07:37,359 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:07:37,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:07:37,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:07:37,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:07:37,368 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:07:37,373 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:07:37,374 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:07:37,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:07:37,382 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:07:37,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:07:37,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:07:37,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:07:37,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:07:37,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:07:37,389 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:07:37,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:07:37,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:07:37,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:07:37,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:07:37,392 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:07:37,392 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:07:37,393 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:07:37,394 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:07:37,394 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:07:37,407 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:07:37,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:07:37,408 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:07:37,408 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:07:37,409 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:07:37,409 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:07:37,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:07:37,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:07:37,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:07:37,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:07:37,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:07:37,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:07:37,411 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:07:37,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:07:37,411 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:07:37,411 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:07:37,411 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:07:37,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:07:37,416 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:07:37,418 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:07:37,418 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:07:37,472 INFO ]: Repository-Root is: /tmp [2018-06-22 11:07:37,489 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:07:37,494 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:07:37,496 INFO ]: Initializing SmtParser... [2018-06-22 11:07:37,496 INFO ]: SmtParser initialized [2018-06-22 11:07:37,497 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/001-horn.smt2 [2018-06-22 11:07:37,498 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:07:37,600 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/001-horn.smt2 unknown [2018-06-22 11:07:37,952 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/001-horn.smt2 [2018-06-22 11:07:37,957 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:07:37,963 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:07:37,964 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:07:37,964 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:07:37,964 INFO ]: ChcToBoogie initialized [2018-06-22 11:07:37,967 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:07:37" (1/1) ... [2018-06-22 11:07:38,027 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:38 Unit [2018-06-22 11:07:38,028 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:07:38,028 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:07:38,028 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:07:38,029 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:07:38,051 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:38" (1/1) ... [2018-06-22 11:07:38,052 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:38" (1/1) ... [2018-06-22 11:07:38,069 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:38" (1/1) ... [2018-06-22 11:07:38,069 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:38" (1/1) ... [2018-06-22 11:07:38,087 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:38" (1/1) ... [2018-06-22 11:07:38,092 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:38" (1/1) ... [2018-06-22 11:07:38,098 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:38" (1/1) ... [2018-06-22 11:07:38,101 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:07:38,102 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:07:38,102 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:07:38,102 INFO ]: RCFGBuilder initialized [2018-06-22 11:07:38,103 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:07:38,121 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:07:38,121 INFO ]: Found specification of procedure False [2018-06-22 11:07:38,121 INFO ]: Found implementation of procedure False [2018-06-22 11:07:38,121 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:07:38,121 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:07:38,121 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:07:38,121 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:07:38,121 INFO ]: Found specification of procedure REC__f [2018-06-22 11:07:38,121 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:07:38,121 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:07:38,121 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:07:38,121 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:07:38,121 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:07:38,121 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:07:38,121 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:07:39,059 INFO ]: Using library mode [2018-06-22 11:07:39,060 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:07:39 BoogieIcfgContainer [2018-06-22 11:07:39,060 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:07:39,063 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:07:39,063 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:07:39,070 INFO ]: TraceAbstraction initialized [2018-06-22 11:07:39,070 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:07:37" (1/3) ... [2018-06-22 11:07:39,071 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7f9d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:07:39, skipping insertion in model container [2018-06-22 11:07:39,071 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:38" (2/3) ... [2018-06-22 11:07:39,072 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7f9d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:07:39, skipping insertion in model container [2018-06-22 11:07:39,072 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:07:39" (3/3) ... [2018-06-22 11:07:39,074 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:07:39,084 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:07:39,091 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:07:39,130 INFO ]: Using default assertion order modulation [2018-06-22 11:07:39,130 INFO ]: Interprodecural is true [2018-06-22 11:07:39,130 INFO ]: Hoare is false [2018-06-22 11:07:39,130 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:07:39,131 INFO ]: Backedges is TWOTRACK [2018-06-22 11:07:39,131 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:07:39,131 INFO ]: Difference is false [2018-06-22 11:07:39,131 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:07:39,131 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:07:39,152 INFO ]: Start isEmpty. Operand 91 states. [2018-06-22 11:07:39,178 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:07:39,178 INFO ]: Found error trace [2018-06-22 11:07:39,179 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:07:39,182 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:39,186 INFO ]: Analyzing trace with hash 350648014, now seen corresponding path program 1 times [2018-06-22 11:07:39,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:39,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:39,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:39,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:39,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:39,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:39,260 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:07:39,262 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:39,262 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:07:39,263 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:07:39,274 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:07:39,274 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:07:39,276 INFO ]: Start difference. First operand 91 states. Second operand 2 states. [2018-06-22 11:07:39,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:39,316 INFO ]: Finished difference Result 66 states and 143 transitions. [2018-06-22 11:07:39,317 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:07:39,318 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:07:39,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:39,337 INFO ]: With dead ends: 66 [2018-06-22 11:07:39,337 INFO ]: Without dead ends: 66 [2018-06-22 11:07:39,339 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:07:39,355 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:07:39,391 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-22 11:07:39,392 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:07:39,396 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 143 transitions. [2018-06-22 11:07:39,398 INFO ]: Start accepts. Automaton has 66 states and 143 transitions. Word has length 5 [2018-06-22 11:07:39,399 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:39,399 INFO ]: Abstraction has 66 states and 143 transitions. [2018-06-22 11:07:39,399 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:07:39,399 INFO ]: Start isEmpty. Operand 66 states and 143 transitions. [2018-06-22 11:07:39,410 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:07:39,410 INFO ]: Found error trace [2018-06-22 11:07:39,410 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:39,410 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:39,410 INFO ]: Analyzing trace with hash -2143612445, now seen corresponding path program 1 times [2018-06-22 11:07:39,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:39,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:39,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:39,411 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:39,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:39,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:39,553 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:07:39,553 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:39,554 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:39,555 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:39,555 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:39,555 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:39,556 INFO ]: Start difference. First operand 66 states and 143 transitions. Second operand 4 states. [2018-06-22 11:07:40,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:40,073 INFO ]: Finished difference Result 70 states and 167 transitions. [2018-06-22 11:07:40,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:07:40,073 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:07:40,074 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:40,078 INFO ]: With dead ends: 70 [2018-06-22 11:07:40,078 INFO ]: Without dead ends: 70 [2018-06-22 11:07:40,079 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:40,079 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:07:40,099 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-06-22 11:07:40,099 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:07:40,102 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 165 transitions. [2018-06-22 11:07:40,102 INFO ]: Start accepts. Automaton has 68 states and 165 transitions. Word has length 9 [2018-06-22 11:07:40,102 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:40,102 INFO ]: Abstraction has 68 states and 165 transitions. [2018-06-22 11:07:40,102 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:40,102 INFO ]: Start isEmpty. Operand 68 states and 165 transitions. [2018-06-22 11:07:40,108 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:07:40,108 INFO ]: Found error trace [2018-06-22 11:07:40,108 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:40,108 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:40,108 INFO ]: Analyzing trace with hash -215706114, now seen corresponding path program 1 times [2018-06-22 11:07:40,108 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:40,108 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:40,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:40,109 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:40,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:40,117 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:40,157 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:07:40,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:40,157 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:40,157 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:40,157 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:40,157 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:40,158 INFO ]: Start difference. First operand 68 states and 165 transitions. Second operand 4 states. [2018-06-22 11:07:40,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:40,754 INFO ]: Finished difference Result 74 states and 211 transitions. [2018-06-22 11:07:40,755 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:07:40,755 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:07:40,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:40,759 INFO ]: With dead ends: 74 [2018-06-22 11:07:40,759 INFO ]: Without dead ends: 74 [2018-06-22 11:07:40,759 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:40,759 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:07:40,777 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 68. [2018-06-22 11:07:40,777 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:07:40,780 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 165 transitions. [2018-06-22 11:07:40,780 INFO ]: Start accepts. Automaton has 68 states and 165 transitions. Word has length 13 [2018-06-22 11:07:40,780 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:40,780 INFO ]: Abstraction has 68 states and 165 transitions. [2018-06-22 11:07:40,780 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:40,780 INFO ]: Start isEmpty. Operand 68 states and 165 transitions. [2018-06-22 11:07:40,785 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:07:40,785 INFO ]: Found error trace [2018-06-22 11:07:40,785 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:40,785 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:40,785 INFO ]: Analyzing trace with hash -139839477, now seen corresponding path program 1 times [2018-06-22 11:07:40,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:40,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:40,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:40,786 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:40,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:40,794 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:40,832 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:07:40,832 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:40,832 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:40,833 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:40,833 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:40,833 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:40,833 INFO ]: Start difference. First operand 68 states and 165 transitions. Second operand 4 states. [2018-06-22 11:07:41,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:41,306 INFO ]: Finished difference Result 74 states and 211 transitions. [2018-06-22 11:07:41,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:07:41,307 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:07:41,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:41,310 INFO ]: With dead ends: 74 [2018-06-22 11:07:41,310 INFO ]: Without dead ends: 74 [2018-06-22 11:07:41,311 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:41,311 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:07:41,326 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 68. [2018-06-22 11:07:41,326 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:07:41,328 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 165 transitions. [2018-06-22 11:07:41,328 INFO ]: Start accepts. Automaton has 68 states and 165 transitions. Word has length 13 [2018-06-22 11:07:41,328 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:41,328 INFO ]: Abstraction has 68 states and 165 transitions. [2018-06-22 11:07:41,328 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:41,328 INFO ]: Start isEmpty. Operand 68 states and 165 transitions. [2018-06-22 11:07:41,332 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:07:41,332 INFO ]: Found error trace [2018-06-22 11:07:41,333 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:41,333 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:41,333 INFO ]: Analyzing trace with hash -1971246613, now seen corresponding path program 1 times [2018-06-22 11:07:41,333 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:41,333 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:41,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:41,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:41,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:41,347 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:41,427 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:07:41,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:41,428 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:07:41,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:41,459 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:41,466 INFO ]: Computing forward predicates... [2018-06-22 11:07:41,855 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:07:41,888 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:41,888 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:07:41,889 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:07:41,889 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:07:41,889 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:07:41,889 INFO ]: Start difference. First operand 68 states and 165 transitions. Second operand 10 states. [2018-06-22 11:07:44,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:44,688 INFO ]: Finished difference Result 168 states and 1066 transitions. [2018-06-22 11:07:44,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:07:44,689 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:07:44,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:44,701 INFO ]: With dead ends: 168 [2018-06-22 11:07:44,701 INFO ]: Without dead ends: 168 [2018-06-22 11:07:44,702 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:07:44,717 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-22 11:07:44,841 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-06-22 11:07:44,842 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-22 11:07:44,848 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1020 transitions. [2018-06-22 11:07:44,849 INFO ]: Start accepts. Automaton has 164 states and 1020 transitions. Word has length 13 [2018-06-22 11:07:44,849 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:44,849 INFO ]: Abstraction has 164 states and 1020 transitions. [2018-06-22 11:07:44,849 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:07:44,849 INFO ]: Start isEmpty. Operand 164 states and 1020 transitions. [2018-06-22 11:07:44,858 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:44,858 INFO ]: Found error trace [2018-06-22 11:07:44,858 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:44,858 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:44,859 INFO ]: Analyzing trace with hash 92920990, now seen corresponding path program 1 times [2018-06-22 11:07:44,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:44,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:44,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:44,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:44,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:44,879 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:44,996 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:44,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:44,996 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:07:45,006 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:45,036 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:45,038 INFO ]: Computing forward predicates... [2018-06-22 11:07:45,152 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:07:45,171 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:45,172 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2018-06-22 11:07:45,172 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:07:45,172 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:07:45,172 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:07:45,172 INFO ]: Start difference. First operand 164 states and 1020 transitions. Second operand 10 states. [2018-06-22 11:07:46,001 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:07:48,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:48,073 INFO ]: Finished difference Result 271 states and 2746 transitions. [2018-06-22 11:07:48,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:07:48,076 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:07:48,076 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:48,101 INFO ]: With dead ends: 271 [2018-06-22 11:07:48,101 INFO ]: Without dead ends: 271 [2018-06-22 11:07:48,101 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:07:48,103 INFO ]: Start minimizeSevpa. Operand 271 states. [2018-06-22 11:07:48,283 INFO ]: Finished minimizeSevpa. Reduced states from 271 to 225. [2018-06-22 11:07:48,284 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-22 11:07:48,292 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1949 transitions. [2018-06-22 11:07:48,292 INFO ]: Start accepts. Automaton has 225 states and 1949 transitions. Word has length 17 [2018-06-22 11:07:48,292 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:48,292 INFO ]: Abstraction has 225 states and 1949 transitions. [2018-06-22 11:07:48,292 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:07:48,292 INFO ]: Start isEmpty. Operand 225 states and 1949 transitions. [2018-06-22 11:07:48,305 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:48,305 INFO ]: Found error trace [2018-06-22 11:07:48,305 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:48,305 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:48,306 INFO ]: Analyzing trace with hash 1144298631, now seen corresponding path program 1 times [2018-06-22 11:07:48,306 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:48,306 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:48,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:48,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:48,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:48,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:48,406 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:07:48,406 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:48,406 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:48,406 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:48,406 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:48,406 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:48,406 INFO ]: Start difference. First operand 225 states and 1949 transitions. Second operand 4 states. [2018-06-22 11:07:48,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:48,540 INFO ]: Finished difference Result 237 states and 1920 transitions. [2018-06-22 11:07:48,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:07:48,541 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:07:48,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:48,554 INFO ]: With dead ends: 237 [2018-06-22 11:07:48,554 INFO ]: Without dead ends: 237 [2018-06-22 11:07:48,555 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:48,555 INFO ]: Start minimizeSevpa. Operand 237 states. [2018-06-22 11:07:48,654 INFO ]: Finished minimizeSevpa. Reduced states from 237 to 233. [2018-06-22 11:07:48,654 INFO ]: Start removeUnreachable. Operand 233 states. [2018-06-22 11:07:48,662 INFO ]: Finished removeUnreachable. Reduced from 233 states to 233 states and 1898 transitions. [2018-06-22 11:07:48,662 INFO ]: Start accepts. Automaton has 233 states and 1898 transitions. Word has length 17 [2018-06-22 11:07:48,662 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:48,662 INFO ]: Abstraction has 233 states and 1898 transitions. [2018-06-22 11:07:48,662 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:48,663 INFO ]: Start isEmpty. Operand 233 states and 1898 transitions. [2018-06-22 11:07:48,681 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:07:48,681 INFO ]: Found error trace [2018-06-22 11:07:48,681 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:48,681 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:48,681 INFO ]: Analyzing trace with hash 1570341113, now seen corresponding path program 1 times [2018-06-22 11:07:48,681 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:48,681 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:48,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:48,682 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:48,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:48,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:48,872 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:48,872 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:48,872 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:48,872 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:48,872 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:48,872 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:48,872 INFO ]: Start difference. First operand 233 states and 1898 transitions. Second operand 4 states. [2018-06-22 11:07:49,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:49,945 INFO ]: Finished difference Result 241 states and 2030 transitions. [2018-06-22 11:07:49,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:07:49,947 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:07:49,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:49,962 INFO ]: With dead ends: 241 [2018-06-22 11:07:49,963 INFO ]: Without dead ends: 241 [2018-06-22 11:07:49,963 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:07:49,963 INFO ]: Start minimizeSevpa. Operand 241 states. [2018-06-22 11:07:50,065 INFO ]: Finished minimizeSevpa. Reduced states from 241 to 235. [2018-06-22 11:07:50,065 INFO ]: Start removeUnreachable. Operand 235 states. [2018-06-22 11:07:50,074 INFO ]: Finished removeUnreachable. Reduced from 235 states to 235 states and 1930 transitions. [2018-06-22 11:07:50,074 INFO ]: Start accepts. Automaton has 235 states and 1930 transitions. Word has length 21 [2018-06-22 11:07:50,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:50,074 INFO ]: Abstraction has 235 states and 1930 transitions. [2018-06-22 11:07:50,074 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:50,074 INFO ]: Start isEmpty. Operand 235 states and 1930 transitions. [2018-06-22 11:07:50,088 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:07:50,088 INFO ]: Found error trace [2018-06-22 11:07:50,088 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:50,088 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:50,089 INFO ]: Analyzing trace with hash 1463735238, now seen corresponding path program 1 times [2018-06-22 11:07:50,089 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:50,089 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:50,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:50,090 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:50,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:50,111 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:50,255 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:50,255 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:50,255 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:50,255 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:50,256 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:50,256 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:50,256 INFO ]: Start difference. First operand 235 states and 1930 transitions. Second operand 4 states. [2018-06-22 11:07:50,808 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:50,808 INFO ]: Finished difference Result 241 states and 2024 transitions. [2018-06-22 11:07:50,808 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:07:50,808 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:07:50,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:50,821 INFO ]: With dead ends: 241 [2018-06-22 11:07:50,821 INFO ]: Without dead ends: 241 [2018-06-22 11:07:50,821 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:07:50,821 INFO ]: Start minimizeSevpa. Operand 241 states. [2018-06-22 11:07:50,928 INFO ]: Finished minimizeSevpa. Reduced states from 241 to 233. [2018-06-22 11:07:50,928 INFO ]: Start removeUnreachable. Operand 233 states. [2018-06-22 11:07:50,935 INFO ]: Finished removeUnreachable. Reduced from 233 states to 233 states and 1885 transitions. [2018-06-22 11:07:50,935 INFO ]: Start accepts. Automaton has 233 states and 1885 transitions. Word has length 21 [2018-06-22 11:07:50,935 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:50,935 INFO ]: Abstraction has 233 states and 1885 transitions. [2018-06-22 11:07:50,935 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:50,936 INFO ]: Start isEmpty. Operand 233 states and 1885 transitions. [2018-06-22 11:07:50,950 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:50,950 INFO ]: Found error trace [2018-06-22 11:07:50,950 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:50,951 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:50,952 INFO ]: Analyzing trace with hash 1771405003, now seen corresponding path program 1 times [2018-06-22 11:07:50,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:50,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:50,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:50,953 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:50,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:50,962 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:51,130 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:07:51,130 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:51,130 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:51,130 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:51,130 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:51,130 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:51,130 INFO ]: Start difference. First operand 233 states and 1885 transitions. Second operand 4 states. [2018-06-22 11:07:51,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:51,296 INFO ]: Finished difference Result 221 states and 1477 transitions. [2018-06-22 11:07:51,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:07:51,296 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:07:51,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:51,302 INFO ]: With dead ends: 221 [2018-06-22 11:07:51,302 INFO ]: Without dead ends: 182 [2018-06-22 11:07:51,302 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:51,302 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-22 11:07:51,353 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-06-22 11:07:51,353 INFO ]: Start removeUnreachable. Operand 182 states. [2018-06-22 11:07:51,358 INFO ]: Finished removeUnreachable. Reduced from 182 states to 182 states and 1140 transitions. [2018-06-22 11:07:51,358 INFO ]: Start accepts. Automaton has 182 states and 1140 transitions. Word has length 17 [2018-06-22 11:07:51,358 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:51,358 INFO ]: Abstraction has 182 states and 1140 transitions. [2018-06-22 11:07:51,358 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:51,358 INFO ]: Start isEmpty. Operand 182 states and 1140 transitions. [2018-06-22 11:07:51,368 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:51,368 INFO ]: Found error trace [2018-06-22 11:07:51,368 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:51,368 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:51,368 INFO ]: Analyzing trace with hash 1609850213, now seen corresponding path program 1 times [2018-06-22 11:07:51,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:51,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:51,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:51,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:51,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:51,374 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:51,447 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:07:51,447 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:51,473 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:07:51,487 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:07:51,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:51,512 INFO ]: Computing forward predicates... [2018-06-22 11:07:51,555 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:07:51,578 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:51,578 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:07:51,578 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:07:51,579 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:07:51,579 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:07:51,579 INFO ]: Start difference. First operand 182 states and 1140 transitions. Second operand 9 states. [2018-06-22 11:07:51,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:51,895 INFO ]: Finished difference Result 208 states and 1397 transitions. [2018-06-22 11:07:51,897 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:07:51,897 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:07:51,897 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:51,903 INFO ]: With dead ends: 208 [2018-06-22 11:07:51,904 INFO ]: Without dead ends: 208 [2018-06-22 11:07:51,904 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:07:51,904 INFO ]: Start minimizeSevpa. Operand 208 states. [2018-06-22 11:07:51,966 INFO ]: Finished minimizeSevpa. Reduced states from 208 to 202. [2018-06-22 11:07:51,966 INFO ]: Start removeUnreachable. Operand 202 states. [2018-06-22 11:07:51,971 INFO ]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1355 transitions. [2018-06-22 11:07:51,971 INFO ]: Start accepts. Automaton has 202 states and 1355 transitions. Word has length 17 [2018-06-22 11:07:51,972 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:51,972 INFO ]: Abstraction has 202 states and 1355 transitions. [2018-06-22 11:07:51,972 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:07:51,972 INFO ]: Start isEmpty. Operand 202 states and 1355 transitions. [2018-06-22 11:07:51,982 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:51,982 INFO ]: Found error trace [2018-06-22 11:07:51,982 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:51,982 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:51,982 INFO ]: Analyzing trace with hash 38268729, now seen corresponding path program 1 times [2018-06-22 11:07:51,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:51,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:51,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:51,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:51,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:51,996 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:52,098 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:07:52,098 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:52,098 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:07:52,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:52,113 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:52,115 INFO ]: Computing forward predicates... [2018-06-22 11:07:52,285 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:07:52,306 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:52,306 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:07:52,306 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:07:52,306 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:07:52,306 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:07:52,306 INFO ]: Start difference. First operand 202 states and 1355 transitions. Second operand 9 states. [2018-06-22 11:07:53,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:53,044 INFO ]: Finished difference Result 275 states and 2214 transitions. [2018-06-22 11:07:53,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:07:53,044 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:07:53,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:53,056 INFO ]: With dead ends: 275 [2018-06-22 11:07:53,056 INFO ]: Without dead ends: 275 [2018-06-22 11:07:53,056 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:07:53,056 INFO ]: Start minimizeSevpa. Operand 275 states. [2018-06-22 11:07:53,153 INFO ]: Finished minimizeSevpa. Reduced states from 275 to 239. [2018-06-22 11:07:53,154 INFO ]: Start removeUnreachable. Operand 239 states. [2018-06-22 11:07:53,161 INFO ]: Finished removeUnreachable. Reduced from 239 states to 239 states and 1773 transitions. [2018-06-22 11:07:53,161 INFO ]: Start accepts. Automaton has 239 states and 1773 transitions. Word has length 17 [2018-06-22 11:07:53,161 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:53,161 INFO ]: Abstraction has 239 states and 1773 transitions. [2018-06-22 11:07:53,161 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:07:53,161 INFO ]: Start isEmpty. Operand 239 states and 1773 transitions. [2018-06-22 11:07:53,169 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:53,169 INFO ]: Found error trace [2018-06-22 11:07:53,169 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:53,170 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:53,170 INFO ]: Analyzing trace with hash 586822389, now seen corresponding path program 1 times [2018-06-22 11:07:53,170 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:53,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:53,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:53,170 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:53,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:53,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:53,325 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:53,325 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:53,325 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:53,325 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:53,325 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:53,325 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:53,325 INFO ]: Start difference. First operand 239 states and 1773 transitions. Second operand 4 states. [2018-06-22 11:07:54,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:54,516 INFO ]: Finished difference Result 235 states and 1537 transitions. [2018-06-22 11:07:54,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:07:54,517 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:07:54,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:54,525 INFO ]: With dead ends: 235 [2018-06-22 11:07:54,525 INFO ]: Without dead ends: 235 [2018-06-22 11:07:54,525 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:54,525 INFO ]: Start minimizeSevpa. Operand 235 states. [2018-06-22 11:07:54,614 INFO ]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-06-22 11:07:54,614 INFO ]: Start removeUnreachable. Operand 231 states. [2018-06-22 11:07:54,619 INFO ]: Finished removeUnreachable. Reduced from 231 states to 231 states and 1512 transitions. [2018-06-22 11:07:54,619 INFO ]: Start accepts. Automaton has 231 states and 1512 transitions. Word has length 17 [2018-06-22 11:07:54,620 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:54,620 INFO ]: Abstraction has 231 states and 1512 transitions. [2018-06-22 11:07:54,620 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:54,620 INFO ]: Start isEmpty. Operand 231 states and 1512 transitions. [2018-06-22 11:07:54,627 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:54,627 INFO ]: Found error trace [2018-06-22 11:07:54,627 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:54,627 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:54,628 INFO ]: Analyzing trace with hash -1245349456, now seen corresponding path program 1 times [2018-06-22 11:07:54,628 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:54,628 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:54,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:54,629 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:54,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:54,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:54,901 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:54,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:54,901 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:07:54,908 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:54,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:54,921 INFO ]: Computing forward predicates... [2018-06-22 11:07:55,124 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:55,143 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:55,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:07:55,144 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:07:55,144 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:07:55,144 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:07:55,144 INFO ]: Start difference. First operand 231 states and 1512 transitions. Second operand 10 states. [2018-06-22 11:07:56,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:56,629 INFO ]: Finished difference Result 363 states and 3042 transitions. [2018-06-22 11:07:56,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:07:56,629 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:07:56,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:56,641 INFO ]: With dead ends: 363 [2018-06-22 11:07:56,641 INFO ]: Without dead ends: 363 [2018-06-22 11:07:56,641 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:07:56,642 INFO ]: Start minimizeSevpa. Operand 363 states. [2018-06-22 11:07:56,747 INFO ]: Finished minimizeSevpa. Reduced states from 363 to 296. [2018-06-22 11:07:56,747 INFO ]: Start removeUnreachable. Operand 296 states. [2018-06-22 11:07:56,753 INFO ]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1964 transitions. [2018-06-22 11:07:56,754 INFO ]: Start accepts. Automaton has 296 states and 1964 transitions. Word has length 17 [2018-06-22 11:07:56,754 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:56,754 INFO ]: Abstraction has 296 states and 1964 transitions. [2018-06-22 11:07:56,754 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:07:56,754 INFO ]: Start isEmpty. Operand 296 states and 1964 transitions. [2018-06-22 11:07:56,761 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:07:56,761 INFO ]: Found error trace [2018-06-22 11:07:56,761 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:56,761 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:56,761 INFO ]: Analyzing trace with hash 852352057, now seen corresponding path program 2 times [2018-06-22 11:07:56,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:56,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:56,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:56,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:56,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:56,768 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:56,952 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:56,952 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:56,952 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-22 11:07:56,959 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:07:56,986 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:07:56,986 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:56,988 INFO ]: Computing forward predicates... [2018-06-22 11:07:57,039 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:57,071 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:07:57,072 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-06-22 11:07:57,072 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:07:57,072 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:07:57,072 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:07:57,072 INFO ]: Start difference. First operand 296 states and 1964 transitions. Second operand 9 states. [2018-06-22 11:07:57,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:57,961 INFO ]: Finished difference Result 372 states and 2942 transitions. [2018-06-22 11:07:57,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:07:57,961 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:07:57,961 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:57,971 INFO ]: With dead ends: 372 [2018-06-22 11:07:57,971 INFO ]: Without dead ends: 372 [2018-06-22 11:07:57,975 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:07:57,975 INFO ]: Start minimizeSevpa. Operand 372 states. [2018-06-22 11:07:58,065 INFO ]: Finished minimizeSevpa. Reduced states from 372 to 340. [2018-06-22 11:07:58,066 INFO ]: Start removeUnreachable. Operand 340 states. [2018-06-22 11:07:58,073 INFO ]: Finished removeUnreachable. Reduced from 340 states to 340 states and 2587 transitions. [2018-06-22 11:07:58,074 INFO ]: Start accepts. Automaton has 340 states and 2587 transitions. Word has length 21 [2018-06-22 11:07:58,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:58,074 INFO ]: Abstraction has 340 states and 2587 transitions. [2018-06-22 11:07:58,074 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:07:58,074 INFO ]: Start isEmpty. Operand 340 states and 2587 transitions. [2018-06-22 11:07:58,081 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:07:58,081 INFO ]: Found error trace [2018-06-22 11:07:58,081 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:58,081 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:58,082 INFO ]: Analyzing trace with hash -1207230138, now seen corresponding path program 2 times [2018-06-22 11:07:58,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:58,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:58,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:58,084 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:07:58,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:58,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:58,274 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:58,274 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:58,274 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) [2018-06-22 11:07:58,295 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:07:58,313 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:07:58,313 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:58,314 INFO ]: Computing forward predicates... [2018-06-22 11:07:58,339 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:58,361 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:07:58,361 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-06-22 11:07:58,361 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:07:58,361 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:07:58,361 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:07:58,361 INFO ]: Start difference. First operand 340 states and 2587 transitions. Second operand 9 states. [2018-06-22 11:07:59,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:59,354 INFO ]: Finished difference Result 425 states and 3865 transitions. [2018-06-22 11:07:59,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:07:59,354 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:07:59,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:59,368 INFO ]: With dead ends: 425 [2018-06-22 11:07:59,368 INFO ]: Without dead ends: 425 [2018-06-22 11:07:59,368 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:07:59,369 INFO ]: Start minimizeSevpa. Operand 425 states. [2018-06-22 11:07:59,471 INFO ]: Finished minimizeSevpa. Reduced states from 425 to 388. [2018-06-22 11:07:59,471 INFO ]: Start removeUnreachable. Operand 388 states. [2018-06-22 11:07:59,482 INFO ]: Finished removeUnreachable. Reduced from 388 states to 388 states and 3557 transitions. [2018-06-22 11:07:59,482 INFO ]: Start accepts. Automaton has 388 states and 3557 transitions. Word has length 21 [2018-06-22 11:07:59,482 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:59,482 INFO ]: Abstraction has 388 states and 3557 transitions. [2018-06-22 11:07:59,482 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:07:59,482 INFO ]: Start isEmpty. Operand 388 states and 3557 transitions. [2018-06-22 11:07:59,495 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:07:59,495 INFO ]: Found error trace [2018-06-22 11:07:59,495 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:59,495 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:59,495 INFO ]: Analyzing trace with hash -881300573, now seen corresponding path program 1 times [2018-06-22 11:07:59,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:59,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:59,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:59,496 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:07:59,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:59,505 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:59,702 INFO ]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:07:59,702 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:59,702 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-22 11:07:59,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:59,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:59,755 INFO ]: Computing forward predicates... [2018-06-22 11:07:59,825 INFO ]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:07:59,844 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:59,844 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:07:59,844 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:07:59,845 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:07:59,845 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:07:59,845 INFO ]: Start difference. First operand 388 states and 3557 transitions. Second operand 12 states. [2018-06-22 11:08:00,687 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:08:02,085 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:08:03,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:03,662 INFO ]: Finished difference Result 716 states and 12618 transitions. [2018-06-22 11:08:03,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:08:03,662 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:08:03,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:03,724 INFO ]: With dead ends: 716 [2018-06-22 11:08:03,724 INFO ]: Without dead ends: 716 [2018-06-22 11:08:03,724 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:08:03,725 INFO ]: Start minimizeSevpa. Operand 716 states. [2018-06-22 11:08:04,233 INFO ]: Finished minimizeSevpa. Reduced states from 716 to 508. [2018-06-22 11:08:04,234 INFO ]: Start removeUnreachable. Operand 508 states. [2018-06-22 11:08:04,261 INFO ]: Finished removeUnreachable. Reduced from 508 states to 508 states and 6621 transitions. [2018-06-22 11:08:04,262 INFO ]: Start accepts. Automaton has 508 states and 6621 transitions. Word has length 21 [2018-06-22 11:08:04,262 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:04,262 INFO ]: Abstraction has 508 states and 6621 transitions. [2018-06-22 11:08:04,262 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:08:04,262 INFO ]: Start isEmpty. Operand 508 states and 6621 transitions. [2018-06-22 11:08:04,276 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:08:04,276 INFO ]: Found error trace [2018-06-22 11:08:04,276 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:04,276 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:04,276 INFO ]: Analyzing trace with hash -1241485186, now seen corresponding path program 1 times [2018-06-22 11:08:04,276 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:04,276 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:04,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:04,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:04,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:04,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:04,407 INFO ]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:08:04,407 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:04,407 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-22 11:08:04,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:04,435 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:04,437 INFO ]: Computing forward predicates... [2018-06-22 11:08:04,520 INFO ]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:08:04,540 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:04,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-22 11:08:04,540 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:08:04,541 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:08:04,541 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:08:04,541 INFO ]: Start difference. First operand 508 states and 6621 transitions. Second operand 11 states. [2018-06-22 11:08:04,812 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:08:07,340 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:07,340 INFO ]: Finished difference Result 1115 states and 26161 transitions. [2018-06-22 11:08:07,341 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 11:08:07,341 INFO ]: Start accepts. Automaton has 11 states. Word has length 25 [2018-06-22 11:08:07,341 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:07,604 INFO ]: With dead ends: 1115 [2018-06-22 11:08:07,604 INFO ]: Without dead ends: 1115 [2018-06-22 11:08:07,605 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:08:07,605 INFO ]: Start minimizeSevpa. Operand 1115 states. [2018-06-22 11:08:08,494 INFO ]: Finished minimizeSevpa. Reduced states from 1115 to 863. [2018-06-22 11:08:08,494 INFO ]: Start removeUnreachable. Operand 863 states. [2018-06-22 11:08:08,577 INFO ]: Finished removeUnreachable. Reduced from 863 states to 863 states and 15087 transitions. [2018-06-22 11:08:08,577 INFO ]: Start accepts. Automaton has 863 states and 15087 transitions. Word has length 25 [2018-06-22 11:08:08,577 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:08,577 INFO ]: Abstraction has 863 states and 15087 transitions. [2018-06-22 11:08:08,577 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:08:08,577 INFO ]: Start isEmpty. Operand 863 states and 15087 transitions. [2018-06-22 11:08:08,600 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:08:08,600 INFO ]: Found error trace [2018-06-22 11:08:08,601 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:08,601 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:08,602 INFO ]: Analyzing trace with hash 416106950, now seen corresponding path program 1 times [2018-06-22 11:08:08,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:08,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:08,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:08,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:08,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:08,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:08,687 INFO ]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:08:08,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:08,687 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-22 11:08:08,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:08,734 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:08,736 INFO ]: Computing forward predicates... [2018-06-22 11:08:08,884 INFO ]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:08:08,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:08,906 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2018-06-22 11:08:08,906 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:08:08,906 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:08:08,906 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:08:08,907 INFO ]: Start difference. First operand 863 states and 15087 transitions. Second operand 13 states. [2018-06-22 11:08:11,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:11,277 INFO ]: Finished difference Result 2063 states and 64334 transitions. [2018-06-22 11:08:11,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:08:11,277 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:08:11,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:12,283 INFO ]: With dead ends: 2063 [2018-06-22 11:08:12,283 INFO ]: Without dead ends: 2063 [2018-06-22 11:08:12,283 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:08:12,285 INFO ]: Start minimizeSevpa. Operand 2063 states. [2018-06-22 11:08:14,461 INFO ]: Finished minimizeSevpa. Reduced states from 2063 to 1799. [2018-06-22 11:08:14,461 INFO ]: Start removeUnreachable. Operand 1799 states. [2018-06-22 11:08:14,675 INFO ]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 56399 transitions. [2018-06-22 11:08:14,675 INFO ]: Start accepts. Automaton has 1799 states and 56399 transitions. Word has length 29 [2018-06-22 11:08:14,675 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:14,675 INFO ]: Abstraction has 1799 states and 56399 transitions. [2018-06-22 11:08:14,675 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:08:14,675 INFO ]: Start isEmpty. Operand 1799 states and 56399 transitions. [2018-06-22 11:08:14,694 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:08:14,694 INFO ]: Found error trace [2018-06-22 11:08:14,694 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:14,694 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:14,695 INFO ]: Analyzing trace with hash 838823582, now seen corresponding path program 1 times [2018-06-22 11:08:14,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:14,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:14,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:14,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:14,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:14,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:15,058 INFO ]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:08:15,058 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:15,058 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-22 11:08:15,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:15,094 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:15,096 INFO ]: Computing forward predicates... [2018-06-22 11:08:15,222 INFO ]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:08:15,241 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:15,241 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-06-22 11:08:15,242 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:08:15,242 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:08:15,242 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:08:15,242 INFO ]: Start difference. First operand 1799 states and 56399 transitions. Second operand 11 states. [2018-06-22 11:08:16,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:16,215 INFO ]: Finished difference Result 1532 states and 43421 transitions. [2018-06-22 11:08:16,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:08:16,216 INFO ]: Start accepts. Automaton has 11 states. Word has length 29 [2018-06-22 11:08:16,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:17,804 INFO ]: With dead ends: 1532 [2018-06-22 11:08:17,804 INFO ]: Without dead ends: 1471 [2018-06-22 11:08:17,804 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:08:17,805 INFO ]: Start minimizeSevpa. Operand 1471 states. [2018-06-22 11:08:18,969 INFO ]: Finished minimizeSevpa. Reduced states from 1471 to 1376. [2018-06-22 11:08:18,969 INFO ]: Start removeUnreachable. Operand 1376 states. [2018-06-22 11:08:19,136 INFO ]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 39449 transitions. [2018-06-22 11:08:19,136 INFO ]: Start accepts. Automaton has 1376 states and 39449 transitions. Word has length 29 [2018-06-22 11:08:19,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:19,137 INFO ]: Abstraction has 1376 states and 39449 transitions. [2018-06-22 11:08:19,137 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:08:19,137 INFO ]: Start isEmpty. Operand 1376 states and 39449 transitions. [2018-06-22 11:08:19,164 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:08:19,164 INFO ]: Found error trace [2018-06-22 11:08:19,165 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:19,165 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:19,165 INFO ]: Analyzing trace with hash -2029274097, now seen corresponding path program 1 times [2018-06-22 11:08:19,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:19,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:19,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:19,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:19,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:19,171 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:19,210 INFO ]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:08:19,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:19,211 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-22 11:08:19,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:19,230 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:19,232 INFO ]: Computing forward predicates... [2018-06-22 11:08:19,285 INFO ]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:08:19,310 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:08:19,310 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-06-22 11:08:19,311 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:08:19,311 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:08:19,311 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:08:19,311 INFO ]: Start difference. First operand 1376 states and 39449 transitions. Second operand 8 states. [2018-06-22 11:08:20,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:20,160 INFO ]: Finished difference Result 1438 states and 42119 transitions. [2018-06-22 11:08:20,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:20,160 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:08:20,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:20,814 INFO ]: With dead ends: 1438 [2018-06-22 11:08:20,814 INFO ]: Without dead ends: 1438 [2018-06-22 11:08:20,814 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:08:20,815 INFO ]: Start minimizeSevpa. Operand 1438 states. [2018-06-22 11:08:22,302 INFO ]: Finished minimizeSevpa. Reduced states from 1438 to 1396. [2018-06-22 11:08:22,302 INFO ]: Start removeUnreachable. Operand 1396 states. [2018-06-22 11:08:22,426 INFO ]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 40838 transitions. [2018-06-22 11:08:22,426 INFO ]: Start accepts. Automaton has 1396 states and 40838 transitions. Word has length 25 [2018-06-22 11:08:22,426 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:22,426 INFO ]: Abstraction has 1396 states and 40838 transitions. [2018-06-22 11:08:22,426 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:08:22,426 INFO ]: Start isEmpty. Operand 1396 states and 40838 transitions. [2018-06-22 11:08:22,460 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:08:22,460 INFO ]: Found error trace [2018-06-22 11:08:22,460 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:22,460 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:22,460 INFO ]: Analyzing trace with hash -429734469, now seen corresponding path program 1 times [2018-06-22 11:08:22,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:22,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:22,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:22,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:22,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:22,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:22,802 INFO ]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:08:22,802 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:22,802 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:08:22,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:22,840 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:22,842 INFO ]: Computing forward predicates... [2018-06-22 11:08:23,029 INFO ]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:08:23,048 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:08:23,048 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-06-22 11:08:23,048 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:08:23,048 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:08:23,048 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:08:23,048 INFO ]: Start difference. First operand 1396 states and 40838 transitions. Second operand 8 states. [2018-06-22 11:08:23,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:23,442 INFO ]: Finished difference Result 1456 states and 42763 transitions. [2018-06-22 11:08:23,444 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:23,444 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:08:23,444 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:23,929 INFO ]: With dead ends: 1456 [2018-06-22 11:08:23,929 INFO ]: Without dead ends: 1456 [2018-06-22 11:08:23,930 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:08:23,930 INFO ]: Start minimizeSevpa. Operand 1456 states. [2018-06-22 11:08:25,215 INFO ]: Finished minimizeSevpa. Reduced states from 1456 to 1402. [2018-06-22 11:08:25,215 INFO ]: Start removeUnreachable. Operand 1402 states. [2018-06-22 11:08:25,367 INFO ]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 41371 transitions. [2018-06-22 11:08:25,368 INFO ]: Start accepts. Automaton has 1402 states and 41371 transitions. Word has length 25 [2018-06-22 11:08:25,368 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:25,368 INFO ]: Abstraction has 1402 states and 41371 transitions. [2018-06-22 11:08:25,368 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:08:25,368 INFO ]: Start isEmpty. Operand 1402 states and 41371 transitions. [2018-06-22 11:08:25,389 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:08:25,389 INFO ]: Found error trace [2018-06-22 11:08:25,389 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:25,389 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:25,389 INFO ]: Analyzing trace with hash 448412587, now seen corresponding path program 1 times [2018-06-22 11:08:25,389 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:25,389 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:25,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:25,390 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:25,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:25,399 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:25,548 INFO ]: Checked inductivity of 30 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:08:25,548 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:25,548 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:25,555 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:25,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:25,572 INFO ]: Computing forward predicates... [2018-06-22 11:08:25,792 INFO ]: Checked inductivity of 30 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:08:25,811 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:25,811 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 11:08:25,811 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:08:25,812 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:08:25,812 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:08:25,812 INFO ]: Start difference. First operand 1402 states and 41371 transitions. Second operand 13 states. [2018-06-22 11:08:27,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:27,078 INFO ]: Finished difference Result 2012 states and 89260 transitions. [2018-06-22 11:08:27,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:08:27,079 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 11:08:27,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:28,462 INFO ]: With dead ends: 2012 [2018-06-22 11:08:28,462 INFO ]: Without dead ends: 2012 [2018-06-22 11:08:28,462 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:08:28,463 INFO ]: Start minimizeSevpa. Operand 2012 states. [2018-06-22 11:08:31,072 INFO ]: Finished minimizeSevpa. Reduced states from 2012 to 1554. [2018-06-22 11:08:31,072 INFO ]: Start removeUnreachable. Operand 1554 states. [2018-06-22 11:08:31,309 INFO ]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 55082 transitions. [2018-06-22 11:08:31,309 INFO ]: Start accepts. Automaton has 1554 states and 55082 transitions. Word has length 25 [2018-06-22 11:08:31,309 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:31,309 INFO ]: Abstraction has 1554 states and 55082 transitions. [2018-06-22 11:08:31,309 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:08:31,309 INFO ]: Start isEmpty. Operand 1554 states and 55082 transitions. [2018-06-22 11:08:31,343 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:08:31,343 INFO ]: Found error trace [2018-06-22 11:08:31,344 INFO ]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:31,344 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:31,344 INFO ]: Analyzing trace with hash -1218633150, now seen corresponding path program 1 times [2018-06-22 11:08:31,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:31,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:31,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:31,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:31,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:31,350 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:31,442 INFO ]: Checked inductivity of 30 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:08:31,442 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:31,442 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:31,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:31,472 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:31,474 INFO ]: Computing forward predicates... [2018-06-22 11:08:31,754 INFO ]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:08:31,773 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:31,773 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-22 11:08:31,773 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:08:31,773 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:08:31,773 INFO ]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:08:31,773 INFO ]: Start difference. First operand 1554 states and 55082 transitions. Second operand 16 states. [2018-06-22 11:08:33,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:33,572 INFO ]: Finished difference Result 2346 states and 136276 transitions. [2018-06-22 11:08:33,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:08:33,572 INFO ]: Start accepts. Automaton has 16 states. Word has length 41 [2018-06-22 11:08:33,572 INFO ]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-06-22 11:08:36,509 INFO ]: With dead ends: 2346 [2018-06-22 11:08:36,509 INFO ]: Without dead ends: 2346 [2018-06-22 11:08:36,509 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:08:36,511 INFO ]: Start minimizeSevpa. Operand 2346 states. [2018-06-22 11:08:36,511 WARN ]: Verification canceled [2018-06-22 11:08:36,517 WARN ]: Timeout [2018-06-22 11:08:36,517 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:08:36 BoogieIcfgContainer [2018-06-22 11:08:36,517 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:08:36,518 INFO ]: Toolchain (without parser) took 58560.07 ms. Allocated memory was 306.7 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 253.3 MB in the beginning and 528.6 MB in the end (delta: -275.4 MB). Peak memory consumption was 979.8 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:36,519 INFO ]: SmtParser took 0.46 ms. Allocated memory is still 306.7 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:08:36,519 INFO ]: ChcToBoogie took 64.20 ms. Allocated memory is still 306.7 MB. Free memory was 253.3 MB in the beginning and 251.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:36,519 INFO ]: Boogie Preprocessor took 72.76 ms. Allocated memory is still 306.7 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:36,526 INFO ]: RCFGBuilder took 957.93 ms. Allocated memory is still 306.7 MB. Free memory was 249.3 MB in the beginning and 219.3 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:36,527 INFO ]: TraceAbstraction took 57454.61 ms. Allocated memory was 306.7 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 219.3 MB in the beginning and 528.6 MB in the end (delta: -309.4 MB). Peak memory consumption was 945.8 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:36,529 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.46 ms. Allocated memory is still 306.7 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.20 ms. Allocated memory is still 306.7 MB. Free memory was 253.3 MB in the beginning and 251.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 72.76 ms. Allocated memory is still 306.7 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 957.93 ms. Allocated memory is still 306.7 MB. Free memory was 249.3 MB in the beginning and 219.3 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57454.61 ms. Allocated memory was 306.7 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 219.3 MB in the beginning and 528.6 MB in the end (delta: -309.4 MB). Peak memory consumption was 945.8 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 executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 91 locations, 1 error locations. TIMEOUT Result, 57.3s OverallTime, 24 OverallIterations, 5 TraceHistogramMax, 37.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3111 SDtfs, 229 SDslu, 10603 SDs, 0 SdLazy, 15731 SolverSat, 3578 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 667 GetRequests, 370 SyntacticMatches, 13 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1799occurred in iteration=19, 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: 12.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 1637 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 819 NumberOfCodeBlocks, 819 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 780 ConstructedInterpolants, 0 QuantifiedInterpolants, 46308 SizeOfPredicates, 71 NumberOfNonLiveVariables, 1948 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 39 InterpolantComputations, 13 PerfectInterpolantSequences, 325/441 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_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-08-36-543.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/001-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-08-36-543.csv Completed graceful shutdown