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/014c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:16:37,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:16:37,267 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:16:37,279 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:16:37,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:16:37,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:16:37,282 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:16:37,284 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:16:37,285 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:16:37,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:16:37,287 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:16:37,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:16:37,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:16:37,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:16:37,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:16:37,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:16:37,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:16:37,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:16:37,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:16:37,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:16:37,308 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:16:37,314 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:16:37,314 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:16:37,314 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:16:37,315 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:16:37,316 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:16:37,317 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:16:37,317 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:16:37,320 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:16:37,321 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:16:37,321 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:16:37,322 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:16:37,322 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:16:37,323 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:16:37,323 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:16:37,323 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:16:37,349 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:16:37,349 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:16:37,349 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:16:37,349 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:16:37,350 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:16:37,350 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:16:37,351 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:16:37,351 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:16:37,351 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:16:37,351 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:16:37,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:16:37,352 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:16:37,352 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:16:37,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:16:37,352 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:16:37,352 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:16:37,353 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:16:37,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:16:37,354 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:16:37,355 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:16:37,355 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:16:37,394 INFO ]: Repository-Root is: /tmp [2018-06-22 11:16:37,409 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:16:37,413 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:16:37,414 INFO ]: Initializing SmtParser... [2018-06-22 11:16:37,415 INFO ]: SmtParser initialized [2018-06-22 11:16:37,415 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 [2018-06-22 11:16:37,417 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:16:37,501 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 unknown [2018-06-22 11:16:37,730 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 [2018-06-22 11:16:37,735 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:16:37,742 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:16:37,743 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:16:37,743 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:16:37,743 INFO ]: ChcToBoogie initialized [2018-06-22 11:16:37,746 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:16:37" (1/1) ... [2018-06-22 11:16:37,793 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:37 Unit [2018-06-22 11:16:37,793 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:16:37,794 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:16:37,794 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:16:37,794 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:16:37,816 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:37" (1/1) ... [2018-06-22 11:16:37,817 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:37" (1/1) ... [2018-06-22 11:16:37,825 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:37" (1/1) ... [2018-06-22 11:16:37,825 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:37" (1/1) ... [2018-06-22 11:16:37,829 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:37" (1/1) ... [2018-06-22 11:16:37,831 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:37" (1/1) ... [2018-06-22 11:16:37,832 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:37" (1/1) ... [2018-06-22 11:16:37,839 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:16:37,840 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:16:37,840 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:16:37,840 INFO ]: RCFGBuilder initialized [2018-06-22 11:16:37,841 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:37" (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:16:37,859 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:16:37,859 INFO ]: Found specification of procedure False [2018-06-22 11:16:37,859 INFO ]: Found implementation of procedure False [2018-06-22 11:16:37,859 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:16:37,859 INFO ]: Found specification of procedure REC__f [2018-06-22 11:16:37,859 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:16:37,859 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:16:37,859 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:16:37,859 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:16:37,859 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:16:37,859 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:16:37,859 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:16:37,859 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:16:37,859 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:16:37,859 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:16:38,246 INFO ]: Using library mode [2018-06-22 11:16:38,247 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:16:38 BoogieIcfgContainer [2018-06-22 11:16:38,247 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:16:38,248 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:16:38,248 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:16:38,251 INFO ]: TraceAbstraction initialized [2018-06-22 11:16:38,251 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:16:37" (1/3) ... [2018-06-22 11:16:38,252 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39dd339f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:16:38, skipping insertion in model container [2018-06-22 11:16:38,252 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:37" (2/3) ... [2018-06-22 11:16:38,252 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39dd339f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:16:38, skipping insertion in model container [2018-06-22 11:16:38,252 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:16:38" (3/3) ... [2018-06-22 11:16:38,254 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:16:38,263 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:16:38,269 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:16:38,309 INFO ]: Using default assertion order modulation [2018-06-22 11:16:38,310 INFO ]: Interprodecural is true [2018-06-22 11:16:38,310 INFO ]: Hoare is false [2018-06-22 11:16:38,310 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:16:38,310 INFO ]: Backedges is TWOTRACK [2018-06-22 11:16:38,310 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:16:38,310 INFO ]: Difference is false [2018-06-22 11:16:38,310 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:16:38,310 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:16:38,323 INFO ]: Start isEmpty. Operand 30 states. [2018-06-22 11:16:38,335 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:16:38,335 INFO ]: Found error trace [2018-06-22 11:16:38,336 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:16:38,336 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:38,341 INFO ]: Analyzing trace with hash 115835164, now seen corresponding path program 1 times [2018-06-22 11:16:38,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:38,343 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:38,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:38,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:38,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:38,399 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:38,419 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:16:38,421 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:38,421 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:16:38,423 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:16:38,433 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:16:38,433 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:16:38,435 INFO ]: Start difference. First operand 30 states. Second operand 2 states. [2018-06-22 11:16:38,457 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:38,457 INFO ]: Finished difference Result 26 states and 43 transitions. [2018-06-22 11:16:38,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:16:38,459 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:16:38,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:38,478 INFO ]: With dead ends: 26 [2018-06-22 11:16:38,478 INFO ]: Without dead ends: 26 [2018-06-22 11:16:38,479 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:16:38,493 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:16:38,528 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:16:38,529 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:16:38,530 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2018-06-22 11:16:38,532 INFO ]: Start accepts. Automaton has 26 states and 43 transitions. Word has length 5 [2018-06-22 11:16:38,532 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:38,532 INFO ]: Abstraction has 26 states and 43 transitions. [2018-06-22 11:16:38,532 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:16:38,532 INFO ]: Start isEmpty. Operand 26 states and 43 transitions. [2018-06-22 11:16:38,534 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:16:38,534 INFO ]: Found error trace [2018-06-22 11:16:38,534 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:38,534 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:38,535 INFO ]: Analyzing trace with hash 455999655, now seen corresponding path program 1 times [2018-06-22 11:16:38,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:38,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:38,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:38,536 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:38,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:38,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:38,633 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:16:38,633 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:38,633 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:38,634 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:38,634 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:38,634 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:38,634 INFO ]: Start difference. First operand 26 states and 43 transitions. Second operand 4 states. [2018-06-22 11:16:38,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:38,685 INFO ]: Finished difference Result 30 states and 48 transitions. [2018-06-22 11:16:38,686 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:38,686 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:16:38,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:38,687 INFO ]: With dead ends: 30 [2018-06-22 11:16:38,687 INFO ]: Without dead ends: 30 [2018-06-22 11:16:38,688 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:16:38,688 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:16:38,698 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-22 11:16:38,699 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:16:38,700 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2018-06-22 11:16:38,700 INFO ]: Start accepts. Automaton has 28 states and 46 transitions. Word has length 9 [2018-06-22 11:16:38,700 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:38,700 INFO ]: Abstraction has 28 states and 46 transitions. [2018-06-22 11:16:38,700 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:38,700 INFO ]: Start isEmpty. Operand 28 states and 46 transitions. [2018-06-22 11:16:38,702 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:16:38,702 INFO ]: Found error trace [2018-06-22 11:16:38,702 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:38,702 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:38,702 INFO ]: Analyzing trace with hash 741693879, now seen corresponding path program 1 times [2018-06-22 11:16:38,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:38,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:38,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:38,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:38,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:38,709 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:38,759 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:16:38,759 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:38,759 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:38,759 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:38,759 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:38,759 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:38,760 INFO ]: Start difference. First operand 28 states and 46 transitions. Second operand 4 states. [2018-06-22 11:16:38,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:38,886 INFO ]: Finished difference Result 32 states and 52 transitions. [2018-06-22 11:16:38,889 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:38,889 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:16:38,889 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:38,890 INFO ]: With dead ends: 32 [2018-06-22 11:16:38,890 INFO ]: Without dead ends: 32 [2018-06-22 11:16:38,890 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:16:38,891 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:16:38,898 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 11:16:38,898 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:16:38,901 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 50 transitions. [2018-06-22 11:16:38,901 INFO ]: Start accepts. Automaton has 30 states and 50 transitions. Word has length 9 [2018-06-22 11:16:38,902 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:38,902 INFO ]: Abstraction has 30 states and 50 transitions. [2018-06-22 11:16:38,902 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:38,903 INFO ]: Start isEmpty. Operand 30 states and 50 transitions. [2018-06-22 11:16:38,904 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:16:38,904 INFO ]: Found error trace [2018-06-22 11:16:38,904 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:38,904 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:38,904 INFO ]: Analyzing trace with hash -1654089390, now seen corresponding path program 1 times [2018-06-22 11:16:38,904 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:38,904 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:38,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:38,905 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:38,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:38,914 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:38,959 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:16:38,959 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:38,959 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:38,959 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:38,959 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:38,959 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:38,960 INFO ]: Start difference. First operand 30 states and 50 transitions. Second operand 4 states. [2018-06-22 11:16:39,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:39,131 INFO ]: Finished difference Result 36 states and 59 transitions. [2018-06-22 11:16:39,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:39,132 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:16:39,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:39,133 INFO ]: With dead ends: 36 [2018-06-22 11:16:39,133 INFO ]: Without dead ends: 36 [2018-06-22 11:16:39,133 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:16:39,133 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:16:39,143 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-06-22 11:16:39,143 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:16:39,145 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-06-22 11:16:39,145 INFO ]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 9 [2018-06-22 11:16:39,145 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:39,145 INFO ]: Abstraction has 34 states and 57 transitions. [2018-06-22 11:16:39,145 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:39,145 INFO ]: Start isEmpty. Operand 34 states and 57 transitions. [2018-06-22 11:16:39,146 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:39,146 INFO ]: Found error trace [2018-06-22 11:16:39,146 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:39,146 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:39,146 INFO ]: Analyzing trace with hash 877674411, now seen corresponding path program 1 times [2018-06-22 11:16:39,146 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:39,146 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:39,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:39,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:39,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:39,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:39,211 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:16:39,211 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:39,211 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:39,211 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:39,211 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:39,212 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:39,212 INFO ]: Start difference. First operand 34 states and 57 transitions. Second operand 4 states. [2018-06-22 11:16:39,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:39,293 INFO ]: Finished difference Result 34 states and 56 transitions. [2018-06-22 11:16:39,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:39,294 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:16:39,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:39,295 INFO ]: With dead ends: 34 [2018-06-22 11:16:39,295 INFO ]: Without dead ends: 33 [2018-06-22 11:16:39,295 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:16:39,295 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:16:39,301 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-22 11:16:39,301 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:16:39,302 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2018-06-22 11:16:39,302 INFO ]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 13 [2018-06-22 11:16:39,302 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:39,303 INFO ]: Abstraction has 31 states and 51 transitions. [2018-06-22 11:16:39,303 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:39,303 INFO ]: Start isEmpty. Operand 31 states and 51 transitions. [2018-06-22 11:16:39,304 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:39,304 INFO ]: Found error trace [2018-06-22 11:16:39,305 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:39,305 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:39,305 INFO ]: Analyzing trace with hash 640701036, now seen corresponding path program 1 times [2018-06-22 11:16:39,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:39,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:39,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:39,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:39,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:39,313 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:39,345 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:16:39,345 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:39,345 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:39,345 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:39,346 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:39,346 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:39,346 INFO ]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2018-06-22 11:16:39,386 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:39,386 INFO ]: Finished difference Result 37 states and 60 transitions. [2018-06-22 11:16:39,386 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:39,386 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:16:39,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:39,387 INFO ]: With dead ends: 37 [2018-06-22 11:16:39,387 INFO ]: Without dead ends: 37 [2018-06-22 11:16:39,388 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:16:39,388 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:16:39,394 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-06-22 11:16:39,394 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:16:39,395 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2018-06-22 11:16:39,395 INFO ]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 13 [2018-06-22 11:16:39,395 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:39,395 INFO ]: Abstraction has 31 states and 51 transitions. [2018-06-22 11:16:39,395 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:39,395 INFO ]: Start isEmpty. Operand 31 states and 51 transitions. [2018-06-22 11:16:39,396 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:39,397 INFO ]: Found error trace [2018-06-22 11:16:39,397 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:39,397 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:39,397 INFO ]: Analyzing trace with hash 1524229752, now seen corresponding path program 1 times [2018-06-22 11:16:39,397 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:39,397 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:39,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:39,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:39,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:39,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:39,438 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:16:39,438 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:39,438 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:39,438 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:39,438 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:39,438 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:39,438 INFO ]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2018-06-22 11:16:39,563 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:39,564 INFO ]: Finished difference Result 33 states and 52 transitions. [2018-06-22 11:16:39,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:39,564 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:16:39,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:39,565 INFO ]: With dead ends: 33 [2018-06-22 11:16:39,565 INFO ]: Without dead ends: 33 [2018-06-22 11:16:39,565 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:16:39,565 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:16:39,569 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-22 11:16:39,569 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:16:39,570 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2018-06-22 11:16:39,570 INFO ]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 13 [2018-06-22 11:16:39,570 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:39,570 INFO ]: Abstraction has 29 states and 47 transitions. [2018-06-22 11:16:39,570 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:39,570 INFO ]: Start isEmpty. Operand 29 states and 47 transitions. [2018-06-22 11:16:39,572 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:39,572 INFO ]: Found error trace [2018-06-22 11:16:39,572 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:39,572 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:39,572 INFO ]: Analyzing trace with hash 1505566479, now seen corresponding path program 1 times [2018-06-22 11:16:39,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:39,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:39,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:39,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:39,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:39,582 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:39,639 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:16:39,639 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:39,639 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:39,642 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:39,642 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:39,642 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:39,642 INFO ]: Start difference. First operand 29 states and 47 transitions. Second operand 4 states. [2018-06-22 11:16:39,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:39,677 INFO ]: Finished difference Result 35 states and 55 transitions. [2018-06-22 11:16:39,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:39,677 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:16:39,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:39,678 INFO ]: With dead ends: 35 [2018-06-22 11:16:39,678 INFO ]: Without dead ends: 35 [2018-06-22 11:16:39,679 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:16:39,679 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:16:39,684 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:16:39,684 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:16:39,685 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2018-06-22 11:16:39,685 INFO ]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 13 [2018-06-22 11:16:39,685 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:39,685 INFO ]: Abstraction has 33 states and 52 transitions. [2018-06-22 11:16:39,685 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:39,685 INFO ]: Start isEmpty. Operand 33 states and 52 transitions. [2018-06-22 11:16:39,686 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:39,686 INFO ]: Found error trace [2018-06-22 11:16:39,686 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:39,686 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:39,687 INFO ]: Analyzing trace with hash 406992276, now seen corresponding path program 1 times [2018-06-22 11:16:39,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:39,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:39,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:39,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:39,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:39,697 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:39,859 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:16:39,859 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:39,859 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:16:39,859 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:16:39,859 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:16:39,859 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:16:39,859 INFO ]: Start difference. First operand 33 states and 52 transitions. Second operand 6 states. [2018-06-22 11:16:40,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:40,085 INFO ]: Finished difference Result 37 states and 57 transitions. [2018-06-22 11:16:40,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:16:40,085 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:16:40,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:40,087 INFO ]: With dead ends: 37 [2018-06-22 11:16:40,087 INFO ]: Without dead ends: 37 [2018-06-22 11:16:40,087 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:40,087 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:16:40,094 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-22 11:16:40,094 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:16:40,095 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 55 transitions. [2018-06-22 11:16:40,095 INFO ]: Start accepts. Automaton has 35 states and 55 transitions. Word has length 13 [2018-06-22 11:16:40,095 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:40,095 INFO ]: Abstraction has 35 states and 55 transitions. [2018-06-22 11:16:40,095 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:16:40,095 INFO ]: Start isEmpty. Operand 35 states and 55 transitions. [2018-06-22 11:16:40,099 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:40,099 INFO ]: Found error trace [2018-06-22 11:16:40,099 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:40,099 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:40,099 INFO ]: Analyzing trace with hash 1260315626, now seen corresponding path program 1 times [2018-06-22 11:16:40,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:40,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:40,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:40,100 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:40,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:40,121 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:40,343 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:16:40,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:40,343 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:16:40,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:40,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:40,370 INFO ]: Computing forward predicates... [2018-06-22 11:16:40,731 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:16:40,752 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:40,752 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:16:40,752 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:16:40,752 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:16:40,753 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:16:40,753 INFO ]: Start difference. First operand 35 states and 55 transitions. Second operand 8 states. [2018-06-22 11:16:41,193 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:41,194 INFO ]: Finished difference Result 43 states and 66 transitions. [2018-06-22 11:16:41,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:16:41,194 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:16:41,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:41,194 INFO ]: With dead ends: 43 [2018-06-22 11:16:41,195 INFO ]: Without dead ends: 43 [2018-06-22 11:16:41,195 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:16:41,195 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:16:41,204 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-22 11:16:41,205 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:16:41,209 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2018-06-22 11:16:41,209 INFO ]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 13 [2018-06-22 11:16:41,209 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:41,209 INFO ]: Abstraction has 39 states and 61 transitions. [2018-06-22 11:16:41,209 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:16:41,209 INFO ]: Start isEmpty. Operand 39 states and 61 transitions. [2018-06-22 11:16:41,210 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:41,210 INFO ]: Found error trace [2018-06-22 11:16:41,210 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:41,210 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:41,210 INFO ]: Analyzing trace with hash -1688113915, now seen corresponding path program 1 times [2018-06-22 11:16:41,210 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:41,210 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:41,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:41,211 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:41,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:41,219 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:41,270 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:16:41,270 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:41,270 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:16:41,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:41,298 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:41,300 INFO ]: Computing forward predicates... [2018-06-22 11:16:41,343 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:16:41,366 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:41,366 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:16:41,367 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:16:41,367 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:16:41,367 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:16:41,367 INFO ]: Start difference. First operand 39 states and 61 transitions. Second operand 10 states. [2018-06-22 11:16:42,094 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:42,094 INFO ]: Finished difference Result 47 states and 72 transitions. [2018-06-22 11:16:42,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:16:42,095 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:16:42,095 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:42,095 INFO ]: With dead ends: 47 [2018-06-22 11:16:42,095 INFO ]: Without dead ends: 47 [2018-06-22 11:16:42,096 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:16:42,096 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:16:42,102 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-06-22 11:16:42,102 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:16:42,103 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2018-06-22 11:16:42,103 INFO ]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 13 [2018-06-22 11:16:42,103 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:42,103 INFO ]: Abstraction has 39 states and 60 transitions. [2018-06-22 11:16:42,103 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:16:42,103 INFO ]: Start isEmpty. Operand 39 states and 60 transitions. [2018-06-22 11:16:42,104 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:42,104 INFO ]: Found error trace [2018-06-22 11:16:42,104 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:42,104 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:42,104 INFO ]: Analyzing trace with hash 441156521, now seen corresponding path program 1 times [2018-06-22 11:16:42,104 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:42,104 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:42,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,105 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:42,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,112 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:42,144 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:16:42,144 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:42,145 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:42,145 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:42,145 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:42,145 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:42,145 INFO ]: Start difference. First operand 39 states and 60 transitions. Second operand 4 states. [2018-06-22 11:16:42,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:42,226 INFO ]: Finished difference Result 43 states and 65 transitions. [2018-06-22 11:16:42,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 11:16:42,226 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:16:42,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:42,227 INFO ]: With dead ends: 43 [2018-06-22 11:16:42,227 INFO ]: Without dead ends: 43 [2018-06-22 11:16:42,228 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:16:42,228 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:16:42,233 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-06-22 11:16:42,234 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:16:42,234 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2018-06-22 11:16:42,235 INFO ]: Start accepts. Automaton has 41 states and 63 transitions. Word has length 17 [2018-06-22 11:16:42,235 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:42,235 INFO ]: Abstraction has 41 states and 63 transitions. [2018-06-22 11:16:42,235 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:42,235 INFO ]: Start isEmpty. Operand 41 states and 63 transitions. [2018-06-22 11:16:42,236 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:42,236 INFO ]: Found error trace [2018-06-22 11:16:42,236 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:42,236 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:42,236 INFO ]: Analyzing trace with hash -891272011, now seen corresponding path program 1 times [2018-06-22 11:16:42,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:42,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:42,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:42,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,244 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:42,294 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:16:42,294 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:42,345 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:16:42,345 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:16:42,345 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:16:42,345 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:16:42,345 INFO ]: Start difference. First operand 41 states and 63 transitions. Second operand 6 states. [2018-06-22 11:16:42,404 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:42,404 INFO ]: Finished difference Result 47 states and 71 transitions. [2018-06-22 11:16:42,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:16:42,405 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:16:42,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:42,405 INFO ]: With dead ends: 47 [2018-06-22 11:16:42,405 INFO ]: Without dead ends: 47 [2018-06-22 11:16:42,406 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:42,406 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:16:42,420 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:16:42,422 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:16:42,423 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2018-06-22 11:16:42,423 INFO ]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 17 [2018-06-22 11:16:42,423 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:42,423 INFO ]: Abstraction has 43 states and 67 transitions. [2018-06-22 11:16:42,423 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:16:42,423 INFO ]: Start isEmpty. Operand 43 states and 67 transitions. [2018-06-22 11:16:42,424 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:42,424 INFO ]: Found error trace [2018-06-22 11:16:42,424 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:42,424 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:42,424 INFO ]: Analyzing trace with hash 1660590471, now seen corresponding path program 1 times [2018-06-22 11:16:42,424 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:42,424 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:42,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:42,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:42,710 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:16:42,710 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:42,710 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:16:42,728 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:16:42,739 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:42,743 INFO ]: Computing forward predicates... [2018-06-22 11:16:43,015 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:16:43,042 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:43,042 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:16:43,043 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:16:43,043 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:16:43,043 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:16:43,043 INFO ]: Start difference. First operand 43 states and 67 transitions. Second operand 14 states. [2018-06-22 11:16:43,524 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:43,524 INFO ]: Finished difference Result 49 states and 76 transitions. [2018-06-22 11:16:43,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:16:43,524 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:16:43,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:43,525 INFO ]: With dead ends: 49 [2018-06-22 11:16:43,525 INFO ]: Without dead ends: 49 [2018-06-22 11:16:43,525 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:16:43,525 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:16:43,531 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-06-22 11:16:43,531 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:16:43,532 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2018-06-22 11:16:43,532 INFO ]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 17 [2018-06-22 11:16:43,532 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:43,532 INFO ]: Abstraction has 47 states and 74 transitions. [2018-06-22 11:16:43,532 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:16:43,532 INFO ]: Start isEmpty. Operand 47 states and 74 transitions. [2018-06-22 11:16:43,533 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:43,533 INFO ]: Found error trace [2018-06-22 11:16:43,533 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:43,533 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:43,533 INFO ]: Analyzing trace with hash 127949826, now seen corresponding path program 1 times [2018-06-22 11:16:43,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:43,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:43,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:43,534 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:43,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:43,541 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:43,581 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:16:43,581 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:43,581 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:16:43,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:43,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:43,601 INFO ]: Computing forward predicates... [2018-06-22 11:16:43,762 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:16:43,781 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:43,781 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 11:16:43,781 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:16:43,781 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:16:43,781 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:16:43,782 INFO ]: Start difference. First operand 47 states and 74 transitions. Second operand 12 states. [2018-06-22 11:16:44,295 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:44,295 INFO ]: Finished difference Result 59 states and 84 transitions. [2018-06-22 11:16:44,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:16:44,296 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:16:44,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:44,297 INFO ]: With dead ends: 59 [2018-06-22 11:16:44,297 INFO ]: Without dead ends: 59 [2018-06-22 11:16:44,297 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:16:44,297 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:16:44,305 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-06-22 11:16:44,305 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:16:44,306 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2018-06-22 11:16:44,306 INFO ]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 17 [2018-06-22 11:16:44,306 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:44,306 INFO ]: Abstraction has 49 states and 73 transitions. [2018-06-22 11:16:44,306 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:16:44,306 INFO ]: Start isEmpty. Operand 49 states and 73 transitions. [2018-06-22 11:16:44,307 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:44,307 INFO ]: Found error trace [2018-06-22 11:16:44,307 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:44,307 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:44,307 INFO ]: Analyzing trace with hash 1365576285, now seen corresponding path program 2 times [2018-06-22 11:16:44,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:44,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:44,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:44,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:44,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:44,319 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:44,378 INFO ]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:16:44,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:44,378 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:16:44,384 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:44,394 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:44,394 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:44,395 INFO ]: Computing forward predicates... [2018-06-22 11:16:44,440 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:16:44,459 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:44,459 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:16:44,459 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:16:44,460 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:16:44,460 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:16:44,460 INFO ]: Start difference. First operand 49 states and 73 transitions. Second operand 11 states. [2018-06-22 11:16:44,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:44,614 INFO ]: Finished difference Result 61 states and 90 transitions. [2018-06-22 11:16:44,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:16:44,614 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:16:44,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:44,615 INFO ]: With dead ends: 61 [2018-06-22 11:16:44,615 INFO ]: Without dead ends: 61 [2018-06-22 11:16:44,615 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:16:44,615 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:16:44,620 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 53. [2018-06-22 11:16:44,620 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:16:44,621 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2018-06-22 11:16:44,621 INFO ]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 17 [2018-06-22 11:16:44,621 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:44,621 INFO ]: Abstraction has 53 states and 79 transitions. [2018-06-22 11:16:44,621 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:16:44,621 INFO ]: Start isEmpty. Operand 53 states and 79 transitions. [2018-06-22 11:16:44,622 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:44,622 INFO ]: Found error trace [2018-06-22 11:16:44,622 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:44,623 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:44,623 INFO ]: Analyzing trace with hash 1828068600, now seen corresponding path program 2 times [2018-06-22 11:16:44,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:44,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:44,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:44,623 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:44,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:44,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:44,739 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:16:44,739 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:44,739 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:16:44,747 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:44,773 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:44,773 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:44,775 INFO ]: Computing forward predicates... [2018-06-22 11:16:44,842 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:16:44,861 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:44,861 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 11:16:44,861 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:16:44,861 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:16:44,861 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:16:44,861 INFO ]: Start difference. First operand 53 states and 79 transitions. Second operand 12 states. [2018-06-22 11:16:45,156 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:45,156 INFO ]: Finished difference Result 65 states and 95 transitions. [2018-06-22 11:16:45,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:16:45,156 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:16:45,157 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:45,157 INFO ]: With dead ends: 65 [2018-06-22 11:16:45,157 INFO ]: Without dead ends: 65 [2018-06-22 11:16:45,158 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:16:45,158 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:16:45,163 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-06-22 11:16:45,163 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:16:45,164 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2018-06-22 11:16:45,164 INFO ]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 17 [2018-06-22 11:16:45,165 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:45,165 INFO ]: Abstraction has 59 states and 88 transitions. [2018-06-22 11:16:45,165 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:16:45,165 INFO ]: Start isEmpty. Operand 59 states and 88 transitions. [2018-06-22 11:16:45,165 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:45,166 INFO ]: Found error trace [2018-06-22 11:16:45,166 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:45,166 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:45,166 INFO ]: Analyzing trace with hash -18795624, now seen corresponding path program 1 times [2018-06-22 11:16:45,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:45,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:45,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,167 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:45,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,171 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:45,205 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:16:45,206 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:45,206 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:16:45,206 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:16:45,206 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:16:45,206 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:16:45,206 INFO ]: Start difference. First operand 59 states and 88 transitions. Second operand 6 states. [2018-06-22 11:16:45,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:45,254 INFO ]: Finished difference Result 61 states and 89 transitions. [2018-06-22 11:16:45,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:16:45,254 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:16:45,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:45,255 INFO ]: With dead ends: 61 [2018-06-22 11:16:45,255 INFO ]: Without dead ends: 61 [2018-06-22 11:16:45,256 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:45,256 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:16:45,260 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-06-22 11:16:45,261 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:16:45,261 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2018-06-22 11:16:45,262 INFO ]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 17 [2018-06-22 11:16:45,262 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:45,262 INFO ]: Abstraction has 59 states and 87 transitions. [2018-06-22 11:16:45,262 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:16:45,262 INFO ]: Start isEmpty. Operand 59 states and 87 transitions. [2018-06-22 11:16:45,263 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:16:45,263 INFO ]: Found error trace [2018-06-22 11:16:45,263 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:45,263 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:45,263 INFO ]: Analyzing trace with hash -1035705035, now seen corresponding path program 2 times [2018-06-22 11:16:45,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:45,263 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:45,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,264 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:45,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,272 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:45,337 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:16:45,337 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:45,337 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:45,343 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:45,356 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:45,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:45,358 INFO ]: Computing forward predicates... [2018-06-22 11:16:45,464 INFO ]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:16:45,483 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:45,483 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-22 11:16:45,483 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:16:45,483 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:16:45,483 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:16:45,484 INFO ]: Start difference. First operand 59 states and 87 transitions. Second operand 14 states. [2018-06-22 11:16:45,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:45,799 INFO ]: Finished difference Result 71 states and 100 transitions. [2018-06-22 11:16:45,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:16:45,800 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:16:45,800 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:45,800 INFO ]: With dead ends: 71 [2018-06-22 11:16:45,800 INFO ]: Without dead ends: 71 [2018-06-22 11:16:45,800 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:16:45,801 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:16:45,808 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 61. [2018-06-22 11:16:45,808 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:16:45,809 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2018-06-22 11:16:45,809 INFO ]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 21 [2018-06-22 11:16:45,809 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:45,809 INFO ]: Abstraction has 61 states and 89 transitions. [2018-06-22 11:16:45,809 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:16:45,809 INFO ]: Start isEmpty. Operand 61 states and 89 transitions. [2018-06-22 11:16:45,810 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:16:45,810 INFO ]: Found error trace [2018-06-22 11:16:45,810 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:45,810 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:45,810 INFO ]: Analyzing trace with hash 1599740203, now seen corresponding path program 3 times [2018-06-22 11:16:45,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:45,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:45,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,811 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:45,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,817 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:45,893 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:16:45,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:45,893 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) [2018-06-22 11:16:45,910 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:45,935 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:16:45,935 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:45,937 INFO ]: Computing forward predicates... [2018-06-22 11:16:46,173 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:16:46,192 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:46,192 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:16:46,192 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:16:46,192 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:16:46,192 INFO ]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:16:46,192 INFO ]: Start difference. First operand 61 states and 89 transitions. Second operand 14 states. [2018-06-22 11:16:46,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:46,578 INFO ]: Finished difference Result 75 states and 108 transitions. [2018-06-22 11:16:46,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:16:46,578 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:16:46,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:46,579 INFO ]: With dead ends: 75 [2018-06-22 11:16:46,579 INFO ]: Without dead ends: 75 [2018-06-22 11:16:46,579 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:16:46,579 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:16:46,585 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-06-22 11:16:46,585 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:16:46,586 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 101 transitions. [2018-06-22 11:16:46,586 INFO ]: Start accepts. Automaton has 69 states and 101 transitions. Word has length 21 [2018-06-22 11:16:46,586 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:46,586 INFO ]: Abstraction has 69 states and 101 transitions. [2018-06-22 11:16:46,586 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:16:46,586 INFO ]: Start isEmpty. Operand 69 states and 101 transitions. [2018-06-22 11:16:46,587 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:16:46,587 INFO ]: Found error trace [2018-06-22 11:16:46,587 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:46,587 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:46,587 INFO ]: Analyzing trace with hash 2096235403, now seen corresponding path program 1 times [2018-06-22 11:16:46,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:46,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:46,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:46,588 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:46,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:46,594 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:46,629 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:16:46,629 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:46,629 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:16:46,630 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:16:46,630 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:16:46,630 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:46,630 INFO ]: Start difference. First operand 69 states and 101 transitions. Second operand 7 states. [2018-06-22 11:16:47,090 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:47,090 INFO ]: Finished difference Result 75 states and 108 transitions. [2018-06-22 11:16:47,090 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:16:47,090 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:16:47,091 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:47,091 INFO ]: With dead ends: 75 [2018-06-22 11:16:47,091 INFO ]: Without dead ends: 75 [2018-06-22 11:16:47,092 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:16:47,092 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:16:47,098 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 63. [2018-06-22 11:16:47,098 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:16:47,099 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2018-06-22 11:16:47,099 INFO ]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 21 [2018-06-22 11:16:47,099 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:47,099 INFO ]: Abstraction has 63 states and 93 transitions. [2018-06-22 11:16:47,099 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:16:47,099 INFO ]: Start isEmpty. Operand 63 states and 93 transitions. [2018-06-22 11:16:47,100 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:47,100 INFO ]: Found error trace [2018-06-22 11:16:47,100 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:47,100 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:47,101 INFO ]: Analyzing trace with hash -1323370981, now seen corresponding path program 1 times [2018-06-22 11:16:47,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:47,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:47,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:47,105 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:47,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:47,111 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:47,197 INFO ]: Checked inductivity of 19 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:16:47,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:47,197 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:16:47,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:47,221 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:47,223 INFO ]: Computing forward predicates... [2018-06-22 11:16:47,322 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:16:47,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:47,358 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:16:47,358 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:16:47,358 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:16:47,358 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:16:47,358 INFO ]: Start difference. First operand 63 states and 93 transitions. Second operand 16 states. [2018-06-22 11:16:47,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:47,950 INFO ]: Finished difference Result 87 states and 126 transitions. [2018-06-22 11:16:47,951 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:16:47,951 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:16:47,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:47,952 INFO ]: With dead ends: 87 [2018-06-22 11:16:47,952 INFO ]: Without dead ends: 87 [2018-06-22 11:16:47,952 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:16:47,952 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:16:47,958 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 71. [2018-06-22 11:16:47,958 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 11:16:47,959 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2018-06-22 11:16:47,959 INFO ]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 25 [2018-06-22 11:16:47,960 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:47,960 INFO ]: Abstraction has 71 states and 102 transitions. [2018-06-22 11:16:47,960 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:16:47,960 INFO ]: Start isEmpty. Operand 71 states and 102 transitions. [2018-06-22 11:16:47,961 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:47,961 INFO ]: Found error trace [2018-06-22 11:16:47,961 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:47,961 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:47,961 INFO ]: Analyzing trace with hash -402729427, now seen corresponding path program 2 times [2018-06-22 11:16:47,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:47,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:47,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:47,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:47,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:47,972 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:48,438 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:16:48,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:48,438 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:16:48,443 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:48,492 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:48,492 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:48,496 INFO ]: Computing forward predicates... [2018-06-22 11:16:49,115 INFO ]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:16:49,141 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:49,141 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-22 11:16:49,141 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:16:49,141 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:16:49,142 INFO ]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:16:49,142 INFO ]: Start difference. First operand 71 states and 102 transitions. Second operand 21 states. [2018-06-22 11:16:49,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:49,770 INFO ]: Finished difference Result 77 states and 109 transitions. [2018-06-22 11:16:49,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:16:49,770 INFO ]: Start accepts. Automaton has 21 states. Word has length 25 [2018-06-22 11:16:49,770 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:49,771 INFO ]: With dead ends: 77 [2018-06-22 11:16:49,771 INFO ]: Without dead ends: 77 [2018-06-22 11:16:49,772 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:16:49,772 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 11:16:49,776 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 61. [2018-06-22 11:16:49,776 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:16:49,777 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2018-06-22 11:16:49,777 INFO ]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 25 [2018-06-22 11:16:49,777 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:49,777 INFO ]: Abstraction has 61 states and 89 transitions. [2018-06-22 11:16:49,777 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:16:49,777 INFO ]: Start isEmpty. Operand 61 states and 89 transitions. [2018-06-22 11:16:49,778 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:49,778 INFO ]: Found error trace [2018-06-22 11:16:49,778 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:49,778 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:49,778 INFO ]: Analyzing trace with hash 1206178206, now seen corresponding path program 4 times [2018-06-22 11:16:49,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:49,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:49,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:49,780 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:49,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:49,786 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:50,252 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:16:50,253 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:50,253 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:16:50,258 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:16:50,271 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:16:50,271 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:50,273 INFO ]: Computing forward predicates... [2018-06-22 11:16:50,353 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:16:50,372 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:50,372 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 11:16:50,372 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:16:50,372 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:16:50,372 INFO ]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:16:50,372 INFO ]: Start difference. First operand 61 states and 89 transitions. Second operand 16 states. [2018-06-22 11:16:50,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:50,693 INFO ]: Finished difference Result 79 states and 112 transitions. [2018-06-22 11:16:50,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:16:50,693 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:16:50,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:50,694 INFO ]: With dead ends: 79 [2018-06-22 11:16:50,694 INFO ]: Without dead ends: 79 [2018-06-22 11:16:50,694 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:16:50,694 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:16:50,698 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-06-22 11:16:50,698 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:16:50,699 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2018-06-22 11:16:50,699 INFO ]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 25 [2018-06-22 11:16:50,699 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:50,699 INFO ]: Abstraction has 63 states and 92 transitions. [2018-06-22 11:16:50,699 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:16:50,699 INFO ]: Start isEmpty. Operand 63 states and 92 transitions. [2018-06-22 11:16:50,700 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:50,700 INFO ]: Found error trace [2018-06-22 11:16:50,700 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:50,700 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:50,700 INFO ]: Analyzing trace with hash 172010152, now seen corresponding path program 3 times [2018-06-22 11:16:50,700 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:50,700 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:50,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:50,702 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:50,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:50,708 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:50,834 INFO ]: Checked inductivity of 33 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:16:50,834 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:50,834 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:16:50,840 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:16:50,871 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:16:50,871 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:50,873 INFO ]: Computing forward predicates... [2018-06-22 11:16:50,982 INFO ]: Checked inductivity of 33 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:16:51,000 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:51,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:16:51,001 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:16:51,001 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:16:51,001 INFO ]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:16:51,001 INFO ]: Start difference. First operand 63 states and 92 transitions. Second operand 16 states. [2018-06-22 11:16:51,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:51,935 INFO ]: Finished difference Result 77 states and 106 transitions. [2018-06-22 11:16:51,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:16:51,935 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:16:51,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:51,936 INFO ]: With dead ends: 77 [2018-06-22 11:16:51,936 INFO ]: Without dead ends: 77 [2018-06-22 11:16:51,936 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:16:51,936 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 11:16:51,940 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-06-22 11:16:51,941 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:16:51,941 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2018-06-22 11:16:51,941 INFO ]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 25 [2018-06-22 11:16:51,941 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:51,941 INFO ]: Abstraction has 65 states and 94 transitions. [2018-06-22 11:16:51,941 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:16:51,941 INFO ]: Start isEmpty. Operand 65 states and 94 transitions. [2018-06-22 11:16:51,942 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:51,942 INFO ]: Found error trace [2018-06-22 11:16:51,942 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:51,942 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:51,942 INFO ]: Analyzing trace with hash -1461272756, now seen corresponding path program 1 times [2018-06-22 11:16:51,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:51,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:51,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:51,943 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:51,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:51,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:52,099 INFO ]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:16:52,099 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:52,099 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:52,100 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:52,100 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:52,100 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:52,100 INFO ]: Start difference. First operand 65 states and 94 transitions. Second operand 4 states. [2018-06-22 11:16:52,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:52,269 INFO ]: Finished difference Result 67 states and 98 transitions. [2018-06-22 11:16:52,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:52,270 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:16:52,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:52,270 INFO ]: With dead ends: 67 [2018-06-22 11:16:52,270 INFO ]: Without dead ends: 67 [2018-06-22 11:16:52,271 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:52,271 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:16:52,275 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-06-22 11:16:52,275 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:16:52,276 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2018-06-22 11:16:52,276 INFO ]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 25 [2018-06-22 11:16:52,276 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:52,276 INFO ]: Abstraction has 65 states and 93 transitions. [2018-06-22 11:16:52,276 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:52,276 INFO ]: Start isEmpty. Operand 65 states and 93 transitions. [2018-06-22 11:16:52,277 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:52,277 INFO ]: Found error trace [2018-06-22 11:16:52,277 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:52,277 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:52,277 INFO ]: Analyzing trace with hash -740674585, now seen corresponding path program 1 times [2018-06-22 11:16:52,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:52,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:52,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:52,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:52,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:52,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:52,504 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:16:52,504 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:52,504 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:16:52,504 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:16:52,504 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:16:52,504 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:16:52,504 INFO ]: Start difference. First operand 65 states and 93 transitions. Second operand 6 states. [2018-06-22 11:16:52,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:52,540 INFO ]: Finished difference Result 77 states and 107 transitions. [2018-06-22 11:16:52,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:16:52,540 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:16:52,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:52,541 INFO ]: With dead ends: 77 [2018-06-22 11:16:52,541 INFO ]: Without dead ends: 77 [2018-06-22 11:16:52,541 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:52,541 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 11:16:52,549 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-06-22 11:16:52,549 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:16:52,549 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2018-06-22 11:16:52,549 INFO ]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 25 [2018-06-22 11:16:52,550 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:52,550 INFO ]: Abstraction has 73 states and 102 transitions. [2018-06-22 11:16:52,550 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:16:52,550 INFO ]: Start isEmpty. Operand 73 states and 102 transitions. [2018-06-22 11:16:52,550 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:16:52,550 INFO ]: Found error trace [2018-06-22 11:16:52,550 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:52,550 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:52,551 INFO ]: Analyzing trace with hash -1361475826, now seen corresponding path program 2 times [2018-06-22 11:16:52,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:52,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:52,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:52,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:52,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:52,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:52,631 INFO ]: Checked inductivity of 33 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:16:52,631 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:52,631 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:52,637 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:52,651 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:52,651 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:52,653 INFO ]: Computing forward predicates... [2018-06-22 11:16:52,750 INFO ]: Checked inductivity of 33 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:16:52,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:52,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-06-22 11:16:52,769 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:16:52,769 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:16:52,769 INFO ]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:16:52,769 INFO ]: Start difference. First operand 73 states and 102 transitions. Second operand 18 states. [2018-06-22 11:16:53,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:53,308 INFO ]: Finished difference Result 91 states and 124 transitions. [2018-06-22 11:16:53,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:16:53,308 INFO ]: Start accepts. Automaton has 18 states. Word has length 29 [2018-06-22 11:16:53,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:53,309 INFO ]: With dead ends: 91 [2018-06-22 11:16:53,309 INFO ]: Without dead ends: 91 [2018-06-22 11:16:53,309 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:16:53,309 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:16:53,314 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-06-22 11:16:53,314 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:16:53,315 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2018-06-22 11:16:53,315 INFO ]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 29 [2018-06-22 11:16:53,316 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:53,316 INFO ]: Abstraction has 79 states and 109 transitions. [2018-06-22 11:16:53,316 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:16:53,316 INFO ]: Start isEmpty. Operand 79 states and 109 transitions. [2018-06-22 11:16:53,316 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:16:53,316 INFO ]: Found error trace [2018-06-22 11:16:53,316 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:53,317 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:53,317 INFO ]: Analyzing trace with hash 1796322897, now seen corresponding path program 5 times [2018-06-22 11:16:53,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:53,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:53,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:53,317 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:53,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:53,326 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:53,424 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:16:53,424 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:53,424 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:16:53,430 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:16:53,457 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:16:53,457 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:53,459 INFO ]: Computing forward predicates... [2018-06-22 11:16:53,556 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:16:53,575 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:53,575 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:16:53,575 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:16:53,575 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:16:53,576 INFO ]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:16:53,576 INFO ]: Start difference. First operand 79 states and 109 transitions. Second operand 18 states. [2018-06-22 11:16:53,984 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:53,984 INFO ]: Finished difference Result 103 states and 140 transitions. [2018-06-22 11:16:53,984 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:16:53,984 INFO ]: Start accepts. Automaton has 18 states. Word has length 29 [2018-06-22 11:16:53,984 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:53,984 INFO ]: With dead ends: 103 [2018-06-22 11:16:53,984 INFO ]: Without dead ends: 103 [2018-06-22 11:16:53,985 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=1108, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:16:53,985 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 11:16:53,991 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 81. [2018-06-22 11:16:53,991 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 11:16:53,991 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2018-06-22 11:16:53,991 INFO ]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 29 [2018-06-22 11:16:53,992 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:53,992 INFO ]: Abstraction has 81 states and 112 transitions. [2018-06-22 11:16:53,992 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:16:53,992 INFO ]: Start isEmpty. Operand 81 states and 112 transitions. [2018-06-22 11:16:53,993 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:16:53,993 INFO ]: Found error trace [2018-06-22 11:16:53,993 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:53,993 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:53,994 INFO ]: Analyzing trace with hash 793812059, now seen corresponding path program 4 times [2018-06-22 11:16:53,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:53,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:53,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:53,994 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:53,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:54,001 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:54,195 INFO ]: Checked inductivity of 51 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:16:54,195 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:54,195 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:16:54,201 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:16:54,215 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:16:54,215 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:54,217 INFO ]: Computing forward predicates... [2018-06-22 11:16:54,365 INFO ]: Checked inductivity of 51 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:16:54,384 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:54,384 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-06-22 11:16:54,384 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:16:54,384 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:16:54,384 INFO ]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:16:54,385 INFO ]: Start difference. First operand 81 states and 112 transitions. Second operand 18 states. [2018-06-22 11:16:54,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:54,831 INFO ]: Finished difference Result 99 states and 131 transitions. [2018-06-22 11:16:54,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:16:54,831 INFO ]: Start accepts. Automaton has 18 states. Word has length 29 [2018-06-22 11:16:54,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:54,832 INFO ]: With dead ends: 99 [2018-06-22 11:16:54,832 INFO ]: Without dead ends: 99 [2018-06-22 11:16:54,832 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1354, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:16:54,832 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 11:16:54,839 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 85. [2018-06-22 11:16:54,840 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 11:16:54,840 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2018-06-22 11:16:54,840 INFO ]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 29 [2018-06-22 11:16:54,841 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:54,841 INFO ]: Abstraction has 85 states and 117 transitions. [2018-06-22 11:16:54,841 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:16:54,841 INFO ]: Start isEmpty. Operand 85 states and 117 transitions. [2018-06-22 11:16:54,842 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:16:54,842 INFO ]: Found error trace [2018-06-22 11:16:54,842 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:54,842 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:54,842 INFO ]: Analyzing trace with hash -1628150719, now seen corresponding path program 3 times [2018-06-22 11:16:54,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:54,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:54,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:54,842 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:54,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:54,851 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:54,948 INFO ]: Checked inductivity of 51 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:16:54,948 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:54,948 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:54,960 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:16:54,981 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:16:54,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:54,983 INFO ]: Computing forward predicates... [2018-06-22 11:16:55,174 INFO ]: Checked inductivity of 51 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:16:55,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:55,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-22 11:16:55,194 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:16:55,194 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:16:55,194 INFO ]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:16:55,194 INFO ]: Start difference. First operand 85 states and 117 transitions. Second operand 20 states. [2018-06-22 11:16:56,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:56,056 INFO ]: Finished difference Result 105 states and 141 transitions. [2018-06-22 11:16:56,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:16:56,056 INFO ]: Start accepts. Automaton has 20 states. Word has length 33 [2018-06-22 11:16:56,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:56,057 INFO ]: With dead ends: 105 [2018-06-22 11:16:56,057 INFO ]: Without dead ends: 105 [2018-06-22 11:16:56,058 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=321, Invalid=1749, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:16:56,058 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 11:16:56,064 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 91. [2018-06-22 11:16:56,064 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 11:16:56,065 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2018-06-22 11:16:56,065 INFO ]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 33 [2018-06-22 11:16:56,065 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:56,065 INFO ]: Abstraction has 91 states and 124 transitions. [2018-06-22 11:16:56,065 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:16:56,065 INFO ]: Start isEmpty. Operand 91 states and 124 transitions. [2018-06-22 11:16:56,068 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:16:56,068 INFO ]: Found error trace [2018-06-22 11:16:56,068 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:56,068 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:56,068 INFO ]: Analyzing trace with hash -1551878332, now seen corresponding path program 6 times [2018-06-22 11:16:56,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:56,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:56,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:56,069 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:56,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:56,079 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:57,237 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:16:57,237 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:57,237 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:57,242 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:16:57,263 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:16:57,263 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:57,265 INFO ]: Computing forward predicates... [2018-06-22 11:16:57,425 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:16:57,444 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:57,444 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-22 11:16:57,444 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:16:57,444 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:16:57,444 INFO ]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:16:57,445 INFO ]: Start difference. First operand 91 states and 124 transitions. Second operand 20 states. [2018-06-22 11:16:57,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:57,833 INFO ]: Finished difference Result 117 states and 157 transitions. [2018-06-22 11:16:57,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:16:57,833 INFO ]: Start accepts. Automaton has 20 states. Word has length 33 [2018-06-22 11:16:57,834 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:57,835 INFO ]: With dead ends: 117 [2018-06-22 11:16:57,835 INFO ]: Without dead ends: 117 [2018-06-22 11:16:57,835 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=384, Invalid=1422, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:16:57,835 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:16:57,842 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 93. [2018-06-22 11:16:57,842 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-22 11:16:57,843 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2018-06-22 11:16:57,843 INFO ]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 33 [2018-06-22 11:16:57,843 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:57,843 INFO ]: Abstraction has 93 states and 127 transitions. [2018-06-22 11:16:57,843 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:16:57,843 INFO ]: Start isEmpty. Operand 93 states and 127 transitions. [2018-06-22 11:16:57,847 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:16:57,847 INFO ]: Found error trace [2018-06-22 11:16:57,847 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:57,847 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:57,847 INFO ]: Analyzing trace with hash 2001971790, now seen corresponding path program 5 times [2018-06-22 11:16:57,847 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:57,847 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:57,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:57,848 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:57,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:57,856 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:57,919 INFO ]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:16:57,919 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:57,919 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:57,924 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:16:57,943 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:16:57,943 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:57,945 INFO ]: Computing forward predicates... [2018-06-22 11:16:57,960 INFO ]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:16:57,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:57,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:16:57,979 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:16:57,979 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:16:57,979 INFO ]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:16:57,979 INFO ]: Start difference. First operand 93 states and 127 transitions. Second operand 10 states. [2018-06-22 11:16:58,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:58,041 INFO ]: Finished difference Result 95 states and 129 transitions. [2018-06-22 11:16:58,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:16:58,041 INFO ]: Start accepts. Automaton has 10 states. Word has length 33 [2018-06-22 11:16:58,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:58,042 INFO ]: With dead ends: 95 [2018-06-22 11:16:58,042 INFO ]: Without dead ends: 95 [2018-06-22 11:16:58,042 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:16:58,042 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 11:16:58,046 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-06-22 11:16:58,046 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 11:16:58,047 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2018-06-22 11:16:58,047 INFO ]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 33 [2018-06-22 11:16:58,047 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:58,047 INFO ]: Abstraction has 95 states and 129 transitions. [2018-06-22 11:16:58,047 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:16:58,047 INFO ]: Start isEmpty. Operand 95 states and 129 transitions. [2018-06-22 11:16:58,048 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:16:58,048 INFO ]: Found error trace [2018-06-22 11:16:58,048 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:58,048 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:58,049 INFO ]: Analyzing trace with hash 1910963636, now seen corresponding path program 4 times [2018-06-22 11:16:58,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:58,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:58,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:58,049 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:58,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:58,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:58,766 INFO ]: Checked inductivity of 73 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:16:58,766 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:58,766 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:58,772 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:16:58,801 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:16:58,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:58,802 INFO ]: Computing forward predicates... [2018-06-22 11:16:58,946 INFO ]: Checked inductivity of 73 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:16:58,964 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:58,964 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-06-22 11:16:58,965 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:16:58,965 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:16:58,965 INFO ]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:16:58,965 INFO ]: Start difference. First operand 95 states and 129 transitions. Second operand 22 states. [2018-06-22 11:16:59,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:59,846 INFO ]: Finished difference Result 117 states and 156 transitions. [2018-06-22 11:16:59,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 11:16:59,846 INFO ]: Start accepts. Automaton has 22 states. Word has length 37 [2018-06-22 11:16:59,846 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:59,847 INFO ]: With dead ends: 117 [2018-06-22 11:16:59,847 INFO ]: Without dead ends: 117 [2018-06-22 11:16:59,847 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=428, Invalid=2328, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 11:16:59,847 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:16:59,853 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-06-22 11:16:59,853 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 11:16:59,854 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 134 transitions. [2018-06-22 11:16:59,854 INFO ]: Start accepts. Automaton has 99 states and 134 transitions. Word has length 37 [2018-06-22 11:16:59,854 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:59,854 INFO ]: Abstraction has 99 states and 134 transitions. [2018-06-22 11:16:59,854 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:16:59,854 INFO ]: Start isEmpty. Operand 99 states and 134 transitions. [2018-06-22 11:16:59,857 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:16:59,857 INFO ]: Found error trace [2018-06-22 11:16:59,857 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:59,857 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:59,857 INFO ]: Analyzing trace with hash -474732172, now seen corresponding path program 5 times [2018-06-22 11:16:59,857 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:59,857 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:59,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:59,858 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:59,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:59,866 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:00,294 INFO ]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:17:00,294 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:00,294 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:00,301 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:17:00,322 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:17:00,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:00,324 INFO ]: Computing forward predicates... [2018-06-22 11:17:00,487 INFO ]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:17:00,507 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:00,507 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 11:17:00,508 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:17:00,508 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:17:00,508 INFO ]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:17:00,508 INFO ]: Start difference. First operand 99 states and 134 transitions. Second operand 22 states. [2018-06-22 11:17:00,866 WARN ]: Spent 213.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-06-22 11:17:01,450 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:01,450 INFO ]: Finished difference Result 119 states and 155 transitions. [2018-06-22 11:17:01,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:17:01,451 INFO ]: Start accepts. Automaton has 22 states. Word has length 37 [2018-06-22 11:17:01,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:01,451 INFO ]: With dead ends: 119 [2018-06-22 11:17:01,451 INFO ]: Without dead ends: 119 [2018-06-22 11:17:01,452 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=403, Invalid=2047, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:17:01,452 INFO ]: Start minimizeSevpa. Operand 119 states. [2018-06-22 11:17:01,457 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 93. [2018-06-22 11:17:01,457 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-22 11:17:01,458 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2018-06-22 11:17:01,458 INFO ]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 37 [2018-06-22 11:17:01,458 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:01,458 INFO ]: Abstraction has 93 states and 129 transitions. [2018-06-22 11:17:01,458 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:17:01,458 INFO ]: Start isEmpty. Operand 93 states and 129 transitions. [2018-06-22 11:17:01,459 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:17:01,459 INFO ]: Found error trace [2018-06-22 11:17:01,459 INFO ]: trace histogram [8, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:01,460 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:01,460 INFO ]: Analyzing trace with hash -2058533759, now seen corresponding path program 6 times [2018-06-22 11:17:01,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:01,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:01,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:01,460 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:01,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:01,468 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:01,585 INFO ]: Checked inductivity of 99 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:17:01,585 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:01,585 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:01,593 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:17:01,615 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:17:01,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:01,617 INFO ]: Computing forward predicates... [2018-06-22 11:17:01,781 INFO ]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:17:01,819 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:01,819 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-06-22 11:17:01,819 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:17:01,820 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:17:01,820 INFO ]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:17:01,820 INFO ]: Start difference. First operand 93 states and 129 transitions. Second operand 22 states. [2018-06-22 11:17:03,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:03,101 INFO ]: Finished difference Result 127 states and 164 transitions. [2018-06-22 11:17:03,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:17:03,101 INFO ]: Start accepts. Automaton has 22 states. Word has length 37 [2018-06-22 11:17:03,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:03,102 INFO ]: With dead ends: 127 [2018-06-22 11:17:03,102 INFO ]: Without dead ends: 127 [2018-06-22 11:17:03,103 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=483, Invalid=2273, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 11:17:03,103 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-22 11:17:03,109 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 109. [2018-06-22 11:17:03,109 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 11:17:03,110 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 146 transitions. [2018-06-22 11:17:03,110 INFO ]: Start accepts. Automaton has 109 states and 146 transitions. Word has length 37 [2018-06-22 11:17:03,111 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:03,111 INFO ]: Abstraction has 109 states and 146 transitions. [2018-06-22 11:17:03,111 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:17:03,111 INFO ]: Start isEmpty. Operand 109 states and 146 transitions. [2018-06-22 11:17:03,112 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:17:03,112 INFO ]: Found error trace [2018-06-22 11:17:03,112 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:03,112 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:03,112 INFO ]: Analyzing trace with hash -923548553, now seen corresponding path program 7 times [2018-06-22 11:17:03,112 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:03,112 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:03,113 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:03,113 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:03,113 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:03,121 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:03,207 INFO ]: Checked inductivity of 105 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:17:03,207 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:03,207 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:03,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:03,230 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:03,231 INFO ]: Computing forward predicates... [2018-06-22 11:17:03,333 INFO ]: Checked inductivity of 105 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:17:03,351 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:03,351 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 11:17:03,351 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:17:03,352 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:17:03,352 INFO ]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:17:03,352 INFO ]: Start difference. First operand 109 states and 146 transitions. Second operand 22 states. [2018-06-22 11:17:03,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:03,824 INFO ]: Finished difference Result 133 states and 174 transitions. [2018-06-22 11:17:03,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:17:03,824 INFO ]: Start accepts. Automaton has 22 states. Word has length 37 [2018-06-22 11:17:03,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:03,825 INFO ]: With dead ends: 133 [2018-06-22 11:17:03,825 INFO ]: Without dead ends: 133 [2018-06-22 11:17:03,825 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=481, Invalid=1775, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:17:03,825 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-22 11:17:03,831 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 111. [2018-06-22 11:17:03,831 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-22 11:17:03,832 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 149 transitions. [2018-06-22 11:17:03,832 INFO ]: Start accepts. Automaton has 111 states and 149 transitions. Word has length 37 [2018-06-22 11:17:03,833 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:03,833 INFO ]: Abstraction has 111 states and 149 transitions. [2018-06-22 11:17:03,833 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:17:03,833 INFO ]: Start isEmpty. Operand 111 states and 149 transitions. [2018-06-22 11:17:03,834 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:17:03,834 INFO ]: Found error trace [2018-06-22 11:17:03,834 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:03,834 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:03,834 INFO ]: Analyzing trace with hash 1465109994, now seen corresponding path program 8 times [2018-06-22 11:17:03,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:03,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:03,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:03,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:03,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:03,848 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:04,049 INFO ]: Checked inductivity of 136 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 11:17:04,049 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:04,049 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:04,054 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:04,075 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:04,075 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:04,077 INFO ]: Computing forward predicates... [2018-06-22 11:17:04,097 INFO ]: Checked inductivity of 136 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 11:17:04,116 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:04,116 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 11:17:04,116 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:17:04,116 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:17:04,116 INFO ]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:17:04,116 INFO ]: Start difference. First operand 111 states and 149 transitions. Second operand 13 states. [2018-06-22 11:17:04,222 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:04,222 INFO ]: Finished difference Result 135 states and 177 transitions. [2018-06-22 11:17:04,223 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:17:04,223 INFO ]: Start accepts. Automaton has 13 states. Word has length 41 [2018-06-22 11:17:04,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:04,224 INFO ]: With dead ends: 135 [2018-06-22 11:17:04,224 INFO ]: Without dead ends: 135 [2018-06-22 11:17:04,224 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:17:04,224 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-22 11:17:04,231 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 127. [2018-06-22 11:17:04,231 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-22 11:17:04,232 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 166 transitions. [2018-06-22 11:17:04,232 INFO ]: Start accepts. Automaton has 127 states and 166 transitions. Word has length 41 [2018-06-22 11:17:04,232 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:04,232 INFO ]: Abstraction has 127 states and 166 transitions. [2018-06-22 11:17:04,232 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:17:04,232 INFO ]: Start isEmpty. Operand 127 states and 166 transitions. [2018-06-22 11:17:04,234 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:17:04,234 INFO ]: Found error trace [2018-06-22 11:17:04,234 INFO ]: trace histogram [9, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:04,234 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:04,234 INFO ]: Analyzing trace with hash 6609652, now seen corresponding path program 7 times [2018-06-22 11:17:04,234 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:04,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:04,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:04,235 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:04,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:04,244 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:04,714 INFO ]: Checked inductivity of 129 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:17:04,714 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:04,714 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:04,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:04,751 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:04,753 INFO ]: Computing forward predicates... [2018-06-22 11:17:04,883 INFO ]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:17:04,901 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:04,901 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-06-22 11:17:04,901 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:17:04,901 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:17:04,902 INFO ]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:17:04,902 INFO ]: Start difference. First operand 127 states and 166 transitions. Second operand 24 states. [2018-06-22 11:17:05,601 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:05,601 INFO ]: Finished difference Result 141 states and 183 transitions. [2018-06-22 11:17:05,601 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 11:17:05,601 INFO ]: Start accepts. Automaton has 24 states. Word has length 41 [2018-06-22 11:17:05,601 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:05,602 INFO ]: With dead ends: 141 [2018-06-22 11:17:05,602 INFO ]: Without dead ends: 141 [2018-06-22 11:17:05,603 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=601, Invalid=2821, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 11:17:05,603 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 11:17:05,609 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 137. [2018-06-22 11:17:05,609 INFO ]: Start removeUnreachable. Operand 137 states. [2018-06-22 11:17:05,610 INFO ]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2018-06-22 11:17:05,610 INFO ]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 41 [2018-06-22 11:17:05,610 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:05,610 INFO ]: Abstraction has 137 states and 179 transitions. [2018-06-22 11:17:05,610 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:17:05,611 INFO ]: Start isEmpty. Operand 137 states and 179 transitions. [2018-06-22 11:17:05,612 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:17:05,612 INFO ]: Found error trace [2018-06-22 11:17:05,612 INFO ]: trace histogram [9, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:05,612 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:05,612 INFO ]: Analyzing trace with hash -52091558, now seen corresponding path program 6 times [2018-06-22 11:17:05,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:05,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:05,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:05,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:05,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:05,623 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:05,791 INFO ]: Checked inductivity of 129 backedges. 34 proven. 42 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 11:17:05,791 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:05,791 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:05,797 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:17:05,822 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 11:17:05,822 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:05,824 INFO ]: Computing forward predicates... [2018-06-22 11:17:05,981 INFO ]: Checked inductivity of 129 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-22 11:17:06,000 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:06,000 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2018-06-22 11:17:06,000 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:17:06,000 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:17:06,000 INFO ]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:17:06,001 INFO ]: Start difference. First operand 137 states and 179 transitions. Second operand 26 states. [2018-06-22 11:17:07,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:07,932 INFO ]: Finished difference Result 149 states and 194 transitions. [2018-06-22 11:17:07,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 11:17:07,932 INFO ]: Start accepts. Automaton has 26 states. Word has length 45 [2018-06-22 11:17:07,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:07,933 INFO ]: With dead ends: 149 [2018-06-22 11:17:07,933 INFO ]: Without dead ends: 149 [2018-06-22 11:17:07,934 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=690, Invalid=3732, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 11:17:07,935 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-22 11:17:07,941 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 143. [2018-06-22 11:17:07,941 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-22 11:17:07,943 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 185 transitions. [2018-06-22 11:17:07,943 INFO ]: Start accepts. Automaton has 143 states and 185 transitions. Word has length 45 [2018-06-22 11:17:07,943 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:07,943 INFO ]: Abstraction has 143 states and 185 transitions. [2018-06-22 11:17:07,943 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:17:07,943 INFO ]: Start isEmpty. Operand 143 states and 185 transitions. [2018-06-22 11:17:07,945 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:17:07,945 INFO ]: Found error trace [2018-06-22 11:17:07,945 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:07,945 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:07,945 INFO ]: Analyzing trace with hash -858095289, now seen corresponding path program 1 times [2018-06-22 11:17:07,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:07,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:07,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:07,945 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:07,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:07,957 INFO ]: Conjunction of SSA is sat [2018-06-22 11:17:07,959 INFO ]: Counterexample might be feasible [2018-06-22 11:17:08,079 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:17:08 BoogieIcfgContainer [2018-06-22 11:17:08,079 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:17:08,080 INFO ]: Toolchain (without parser) took 30344.50 ms. Allocated memory was 306.2 MB in the beginning and 657.5 MB in the end (delta: 351.3 MB). Free memory was 261.7 MB in the beginning and 635.2 MB in the end (delta: -373.4 MB). Peak memory consumption was 217.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:08,087 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.2 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:17:08,087 INFO ]: ChcToBoogie took 50.89 ms. Allocated memory is still 306.2 MB. Free memory was 260.7 MB in the beginning and 258.7 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:17:08,087 INFO ]: Boogie Preprocessor took 45.49 ms. Allocated memory is still 306.2 MB. Free memory was 258.7 MB in the beginning and 257.7 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-22 11:17:08,088 INFO ]: RCFGBuilder took 406.98 ms. Allocated memory is still 306.2 MB. Free memory was 257.7 MB in the beginning and 246.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:08,088 INFO ]: TraceAbstraction took 29830.68 ms. Allocated memory was 306.2 MB in the beginning and 657.5 MB in the end (delta: 351.3 MB). Free memory was 245.7 MB in the beginning and 635.2 MB in the end (delta: -389.4 MB). Peak memory consumption was 201.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:08,092 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 306.2 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 50.89 ms. Allocated memory is still 306.2 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.49 ms. Allocated memory is still 306.2 MB. Free memory was 258.7 MB in the beginning and 257.7 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 406.98 ms. Allocated memory is still 306.2 MB. Free memory was 257.7 MB in the beginning and 246.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 29830.68 ms. Allocated memory was 306.2 MB in the beginning and 657.5 MB in the end (delta: 351.3 MB). Free memory was 245.7 MB in the beginning and 635.2 MB in the end (delta: -389.4 MB). Peak memory consumption was 201.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume (((((hbv_False_1_Int + -1 == hbv_False_3_Int && hbv_False_2_Int + -1 == hbv_False_5_Int) && hbv_False_2_Int + -10 == 0) && !(hbv_False_2_Int <= 1)) && !(hbv_False_1_Int + hbv_False_4_Int + -10 == 0)) && !(hbv_False_1_Int <= 0)) && hbv_False_1_Int == hbv_False_2_Int; [L0] CALL call REC_f_f(hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((hhv_REC_f_f_3_Int == hhv_REC_f_f_2_Int && hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hhv_REC_f_f_2_Int <= 1; [L0] CALL call REC_f_(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int); [L0] assume hhv_REC_f__1_Int == hhv_REC_f__0_Int && hhv_REC_f__0_Int <= 0; [L0] RET call REC_f_(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. UNSAFE Result, 29.7s OverallTime, 41 OverallIterations, 9 TraceHistogramMax, 16.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1668 SDtfs, 413 SDslu, 10772 SDs, 0 SdLazy, 6910 SolverSat, 1038 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1507 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 867 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5642 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 40 MinimizatonAttempts, 350 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1658 NumberOfCodeBlocks, 1654 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 1548 ConstructedInterpolants, 0 QuantifiedInterpolants, 130112 SizeOfPredicates, 225 NumberOfNonLiveVariables, 3557 ConjunctsInSsa, 478 ConjunctsInUnsatCore, 65 InterpolantComputations, 15 PerfectInterpolantSequences, 1320/2589 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014c-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-17-08-106.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014c-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-17-08-106.csv Received shutdown request...