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/021-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:20:06,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:20:06,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:20:06,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:20:06,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:20:06,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:20:06,269 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:20:06,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:20:06,273 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:20:06,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:20:06,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:20:06,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:20:06,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:20:06,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:20:06,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:20:06,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:20:06,292 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:20:06,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:20:06,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:20:06,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:20:06,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:20:06,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:20:06,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:20:06,309 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:20:06,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:20:06,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:20:06,312 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:20:06,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:20:06,313 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:20:06,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:20:06,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:20:06,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:20:06,315 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:20:06,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:20:06,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:20:06,320 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:20:06,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:20:06,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:20:06,346 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:20:06,347 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:20:06,348 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:20:06,348 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:20:06,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:20:06,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:20:06,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:20:06,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:20:06,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:20:06,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:20:06,350 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:20:06,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:20:06,350 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:20:06,350 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:20:06,350 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:20:06,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:20:06,351 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:20:06,353 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:20:06,353 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:20:06,398 INFO ]: Repository-Root is: /tmp [2018-06-22 11:20:06,414 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:20:06,419 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:20:06,420 INFO ]: Initializing SmtParser... [2018-06-22 11:20:06,421 INFO ]: SmtParser initialized [2018-06-22 11:20:06,421 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/021-horn.smt2 [2018-06-22 11:20:06,423 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:20:06,517 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/021-horn.smt2 unknown [2018-06-22 11:20:06,742 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/021-horn.smt2 [2018-06-22 11:20:06,747 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:20:06,753 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:20:06,754 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:20:06,754 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:20:06,754 INFO ]: ChcToBoogie initialized [2018-06-22 11:20:06,758 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:20:06" (1/1) ... [2018-06-22 11:20:06,809 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:06 Unit [2018-06-22 11:20:06,809 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:20:06,811 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:20:06,811 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:20:06,811 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:20:06,833 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:06" (1/1) ... [2018-06-22 11:20:06,833 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:06" (1/1) ... [2018-06-22 11:20:06,841 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:06" (1/1) ... [2018-06-22 11:20:06,841 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:06" (1/1) ... [2018-06-22 11:20:06,847 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:06" (1/1) ... [2018-06-22 11:20:06,849 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:06" (1/1) ... [2018-06-22 11:20:06,850 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:06" (1/1) ... [2018-06-22 11:20:06,854 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:20:06,855 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:20:06,855 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:20:06,855 INFO ]: RCFGBuilder initialized [2018-06-22 11:20:06,856 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:06" (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:20:06,878 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:20:06,878 INFO ]: Found specification of procedure False [2018-06-22 11:20:06,878 INFO ]: Found implementation of procedure False [2018-06-22 11:20:06,878 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:20:06,878 INFO ]: Found specification of procedure REC__f [2018-06-22 11:20:06,878 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:20:06,878 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:20:06,878 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:20:06,878 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:20:06,878 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:20:06,878 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:20:06,878 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:20:06,878 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:20:06,878 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:20:06,878 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:20:07,225 INFO ]: Using library mode [2018-06-22 11:20:07,226 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:20:07 BoogieIcfgContainer [2018-06-22 11:20:07,226 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:20:07,228 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:20:07,228 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:20:07,236 INFO ]: TraceAbstraction initialized [2018-06-22 11:20:07,236 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:20:06" (1/3) ... [2018-06-22 11:20:07,237 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd69203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:20:07, skipping insertion in model container [2018-06-22 11:20:07,237 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:06" (2/3) ... [2018-06-22 11:20:07,237 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd69203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:20:07, skipping insertion in model container [2018-06-22 11:20:07,238 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:20:07" (3/3) ... [2018-06-22 11:20:07,240 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:20:07,249 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:20:07,259 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:20:07,298 INFO ]: Using default assertion order modulation [2018-06-22 11:20:07,299 INFO ]: Interprodecural is true [2018-06-22 11:20:07,299 INFO ]: Hoare is false [2018-06-22 11:20:07,299 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:20:07,299 INFO ]: Backedges is TWOTRACK [2018-06-22 11:20:07,299 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:20:07,299 INFO ]: Difference is false [2018-06-22 11:20:07,299 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:20:07,299 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:20:07,314 INFO ]: Start isEmpty. Operand 33 states. [2018-06-22 11:20:07,325 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:20:07,325 INFO ]: Found error trace [2018-06-22 11:20:07,326 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:20:07,326 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:07,330 INFO ]: Analyzing trace with hash 103637743, now seen corresponding path program 1 times [2018-06-22 11:20:07,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:07,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:07,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:07,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:07,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:07,382 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:07,404 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:20:07,405 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:20:07,405 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:20:07,407 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:20:07,416 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:20:07,417 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:20:07,419 INFO ]: Start difference. First operand 33 states. Second operand 2 states. [2018-06-22 11:20:07,444 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:07,444 INFO ]: Finished difference Result 27 states and 40 transitions. [2018-06-22 11:20:07,444 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:20:07,445 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:20:07,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:07,454 INFO ]: With dead ends: 27 [2018-06-22 11:20:07,455 INFO ]: Without dead ends: 27 [2018-06-22 11:20:07,456 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:20:07,468 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:20:07,488 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 11:20:07,489 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:20:07,491 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2018-06-22 11:20:07,492 INFO ]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 5 [2018-06-22 11:20:07,493 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:07,493 INFO ]: Abstraction has 27 states and 40 transitions. [2018-06-22 11:20:07,493 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:20:07,493 INFO ]: Start isEmpty. Operand 27 states and 40 transitions. [2018-06-22 11:20:07,495 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:20:07,495 INFO ]: Found error trace [2018-06-22 11:20:07,495 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:07,495 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:07,496 INFO ]: Analyzing trace with hash 898980463, now seen corresponding path program 1 times [2018-06-22 11:20:07,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:07,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:07,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:07,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:07,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:07,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:07,713 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 11:20:08,080 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:20:08,080 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:08,081 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) [2018-06-22 11:20:08,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:08,121 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:08,129 INFO ]: Computing forward predicates... [2018-06-22 11:20:08,787 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:20:08,808 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:20:08,808 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-06-22 11:20:08,808 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:20:08,809 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:20:08,809 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:20:08,809 INFO ]: Start difference. First operand 27 states and 40 transitions. Second operand 10 states. [2018-06-22 11:20:09,050 WARN ]: Spent 103.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 11:20:09,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:09,254 INFO ]: Finished difference Result 34 states and 54 transitions. [2018-06-22 11:20:09,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:20:09,254 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:20:09,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:09,255 INFO ]: With dead ends: 34 [2018-06-22 11:20:09,255 INFO ]: Without dead ends: 34 [2018-06-22 11:20:09,256 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:20:09,256 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:20:09,269 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-06-22 11:20:09,269 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:20:09,271 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 52 transitions. [2018-06-22 11:20:09,271 INFO ]: Start accepts. Automaton has 32 states and 52 transitions. Word has length 13 [2018-06-22 11:20:09,272 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:09,272 INFO ]: Abstraction has 32 states and 52 transitions. [2018-06-22 11:20:09,272 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:20:09,272 INFO ]: Start isEmpty. Operand 32 states and 52 transitions. [2018-06-22 11:20:09,274 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:20:09,274 INFO ]: Found error trace [2018-06-22 11:20:09,274 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:09,274 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:09,275 INFO ]: Analyzing trace with hash -2110454145, now seen corresponding path program 1 times [2018-06-22 11:20:09,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:09,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:09,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:09,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:09,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:09,293 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:09,891 INFO ]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:20:09,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:09,919 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:20:09,924 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:09,939 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:09,942 INFO ]: Computing forward predicates... [2018-06-22 11:20:10,129 INFO ]: Checked inductivity of 18 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:20:10,161 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:10,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-06-22 11:20:10,162 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:20:10,162 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:20:10,162 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:20:10,162 INFO ]: Start difference. First operand 32 states and 52 transitions. Second operand 16 states. [2018-06-22 11:20:10,531 WARN ]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 22 [2018-06-22 11:20:11,367 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:11,368 INFO ]: Finished difference Result 49 states and 112 transitions. [2018-06-22 11:20:11,368 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:20:11,368 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:20:11,368 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:11,371 INFO ]: With dead ends: 49 [2018-06-22 11:20:11,371 INFO ]: Without dead ends: 49 [2018-06-22 11:20:11,371 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:20:11,372 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:20:11,395 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 38. [2018-06-22 11:20:11,396 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:20:11,398 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 74 transitions. [2018-06-22 11:20:11,398 INFO ]: Start accepts. Automaton has 38 states and 74 transitions. Word has length 21 [2018-06-22 11:20:11,398 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:11,398 INFO ]: Abstraction has 38 states and 74 transitions. [2018-06-22 11:20:11,398 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:20:11,398 INFO ]: Start isEmpty. Operand 38 states and 74 transitions. [2018-06-22 11:20:11,400 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:20:11,400 INFO ]: Found error trace [2018-06-22 11:20:11,400 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:11,401 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:11,401 INFO ]: Analyzing trace with hash -228665275, now seen corresponding path program 1 times [2018-06-22 11:20:11,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:11,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:11,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:11,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:11,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:11,412 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:11,453 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:20:11,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:11,453 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:11,459 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:11,472 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:11,474 INFO ]: Computing forward predicates... [2018-06-22 11:20:11,523 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:20:11,544 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:11,545 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:20:11,545 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:20:11,545 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:20:11,545 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:20:11,545 INFO ]: Start difference. First operand 38 states and 74 transitions. Second operand 8 states. [2018-06-22 11:20:11,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:11,652 INFO ]: Finished difference Result 43 states and 85 transitions. [2018-06-22 11:20:11,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:20:11,652 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:20:11,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:11,654 INFO ]: With dead ends: 43 [2018-06-22 11:20:11,654 INFO ]: Without dead ends: 43 [2018-06-22 11:20:11,654 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:20:11,654 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:20:11,663 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-06-22 11:20:11,663 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:20:11,665 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 83 transitions. [2018-06-22 11:20:11,665 INFO ]: Start accepts. Automaton has 41 states and 83 transitions. Word has length 21 [2018-06-22 11:20:11,665 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:11,665 INFO ]: Abstraction has 41 states and 83 transitions. [2018-06-22 11:20:11,665 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:20:11,665 INFO ]: Start isEmpty. Operand 41 states and 83 transitions. [2018-06-22 11:20:11,668 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:20:11,668 INFO ]: Found error trace [2018-06-22 11:20:11,668 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:11,668 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:11,668 INFO ]: Analyzing trace with hash 880978133, now seen corresponding path program 1 times [2018-06-22 11:20:11,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:11,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:11,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:11,669 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:11,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:11,683 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:11,781 INFO ]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:20:11,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:11,781 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:20:11,786 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:11,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:11,816 INFO ]: Computing forward predicates... [2018-06-22 11:20:12,053 INFO ]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:20:12,072 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:12,072 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-06-22 11:20:12,073 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:20:12,073 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:20:12,073 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:20:12,073 INFO ]: Start difference. First operand 41 states and 83 transitions. Second operand 13 states. [2018-06-22 11:20:12,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:12,636 INFO ]: Finished difference Result 54 states and 134 transitions. [2018-06-22 11:20:12,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:20:12,637 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:20:12,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:12,639 INFO ]: With dead ends: 54 [2018-06-22 11:20:12,639 INFO ]: Without dead ends: 54 [2018-06-22 11:20:12,639 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:20:12,640 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:20:12,651 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-06-22 11:20:12,651 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:20:12,653 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 90 transitions. [2018-06-22 11:20:12,653 INFO ]: Start accepts. Automaton has 42 states and 90 transitions. Word has length 29 [2018-06-22 11:20:12,654 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:12,654 INFO ]: Abstraction has 42 states and 90 transitions. [2018-06-22 11:20:12,654 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:20:12,654 INFO ]: Start isEmpty. Operand 42 states and 90 transitions. [2018-06-22 11:20:12,656 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:20:12,656 INFO ]: Found error trace [2018-06-22 11:20:12,656 INFO ]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:12,656 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:12,657 INFO ]: Analyzing trace with hash 1811063781, now seen corresponding path program 2 times [2018-06-22 11:20:12,657 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:12,657 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:12,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:12,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:12,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:12,671 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:12,770 INFO ]: Checked inductivity of 50 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:20:12,770 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:12,770 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:20:12,775 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:20:12,806 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:20:12,806 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:12,809 INFO ]: Computing forward predicates... [2018-06-22 11:20:12,894 INFO ]: Checked inductivity of 50 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:20:12,913 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:12,913 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2018-06-22 11:20:12,914 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:20:12,914 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:20:12,914 INFO ]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:20:12,914 INFO ]: Start difference. First operand 42 states and 90 transitions. Second operand 16 states. [2018-06-22 11:20:13,443 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:13,443 INFO ]: Finished difference Result 79 states and 319 transitions. [2018-06-22 11:20:13,443 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:20:13,444 INFO ]: Start accepts. Automaton has 16 states. Word has length 37 [2018-06-22 11:20:13,444 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:13,447 INFO ]: With dead ends: 79 [2018-06-22 11:20:13,447 INFO ]: Without dead ends: 79 [2018-06-22 11:20:13,448 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:20:13,448 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:20:13,472 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-06-22 11:20:13,473 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:20:13,475 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 181 transitions. [2018-06-22 11:20:13,475 INFO ]: Start accepts. Automaton has 57 states and 181 transitions. Word has length 37 [2018-06-22 11:20:13,475 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:13,475 INFO ]: Abstraction has 57 states and 181 transitions. [2018-06-22 11:20:13,475 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:20:13,475 INFO ]: Start isEmpty. Operand 57 states and 181 transitions. [2018-06-22 11:20:13,479 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:20:13,479 INFO ]: Found error trace [2018-06-22 11:20:13,480 INFO ]: trace histogram [8, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:13,480 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:13,480 INFO ]: Analyzing trace with hash 755679861, now seen corresponding path program 3 times [2018-06-22 11:20:13,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:13,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:13,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:13,480 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:13,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:13,495 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:13,654 INFO ]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:20:13,654 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:13,654 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:20:13,674 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:13,696 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:20:13,696 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:13,700 INFO ]: Computing forward predicates... [2018-06-22 11:20:13,915 INFO ]: Checked inductivity of 93 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:20:13,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:13,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-22 11:20:13,935 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:20:13,935 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:20:13,935 INFO ]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:20:13,935 INFO ]: Start difference. First operand 57 states and 181 transitions. Second operand 20 states. [2018-06-22 11:20:14,765 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:14,765 INFO ]: Finished difference Result 108 states and 457 transitions. [2018-06-22 11:20:14,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:20:14,766 INFO ]: Start accepts. Automaton has 20 states. Word has length 45 [2018-06-22 11:20:14,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:14,772 INFO ]: With dead ends: 108 [2018-06-22 11:20:14,772 INFO ]: Without dead ends: 108 [2018-06-22 11:20:14,772 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:20:14,773 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:20:14,803 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 70. [2018-06-22 11:20:14,803 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 11:20:14,806 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 241 transitions. [2018-06-22 11:20:14,806 INFO ]: Start accepts. Automaton has 70 states and 241 transitions. Word has length 45 [2018-06-22 11:20:14,806 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:14,806 INFO ]: Abstraction has 70 states and 241 transitions. [2018-06-22 11:20:14,806 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:20:14,806 INFO ]: Start isEmpty. Operand 70 states and 241 transitions. [2018-06-22 11:20:14,810 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:20:14,810 INFO ]: Found error trace [2018-06-22 11:20:14,810 INFO ]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:14,810 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:14,810 INFO ]: Analyzing trace with hash -855418355, now seen corresponding path program 1 times [2018-06-22 11:20:14,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:14,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:14,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:14,811 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:14,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:14,819 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:15,553 INFO ]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:20:15,554 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:15,554 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:20:15,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:15,604 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:15,606 INFO ]: Computing forward predicates... [2018-06-22 11:20:16,010 INFO ]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:20:16,030 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:20:16,030 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-06-22 11:20:16,031 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:20:16,031 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:20:16,031 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:20:16,031 INFO ]: Start difference. First operand 70 states and 241 transitions. Second operand 10 states. [2018-06-22 11:20:16,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:16,920 INFO ]: Finished difference Result 96 states and 425 transitions. [2018-06-22 11:20:16,920 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:20:16,920 INFO ]: Start accepts. Automaton has 10 states. Word has length 37 [2018-06-22 11:20:16,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:16,923 INFO ]: With dead ends: 96 [2018-06-22 11:20:16,923 INFO ]: Without dead ends: 96 [2018-06-22 11:20:16,924 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:20:16,924 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 11:20:16,956 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 83. [2018-06-22 11:20:16,956 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:20:16,961 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 324 transitions. [2018-06-22 11:20:16,961 INFO ]: Start accepts. Automaton has 83 states and 324 transitions. Word has length 37 [2018-06-22 11:20:16,961 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:16,961 INFO ]: Abstraction has 83 states and 324 transitions. [2018-06-22 11:20:16,961 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:20:16,961 INFO ]: Start isEmpty. Operand 83 states and 324 transitions. [2018-06-22 11:20:16,967 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:20:16,967 INFO ]: Found error trace [2018-06-22 11:20:16,967 INFO ]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:16,967 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:16,968 INFO ]: Analyzing trace with hash -906238897, now seen corresponding path program 1 times [2018-06-22 11:20:16,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:16,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:16,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:16,968 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:16,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:16,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:17,111 INFO ]: Checked inductivity of 50 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:20:17,111 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:17,111 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:17,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:17,148 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:17,150 INFO ]: Computing forward predicates... [2018-06-22 11:20:17,307 INFO ]: Checked inductivity of 50 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:20:17,339 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:17,339 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-06-22 11:20:17,339 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:20:17,339 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:20:17,339 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:20:17,339 INFO ]: Start difference. First operand 83 states and 324 transitions. Second operand 8 states. [2018-06-22 11:20:17,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:17,639 INFO ]: Finished difference Result 116 states and 542 transitions. [2018-06-22 11:20:17,640 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:20:17,640 INFO ]: Start accepts. Automaton has 8 states. Word has length 37 [2018-06-22 11:20:17,640 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:17,649 INFO ]: With dead ends: 116 [2018-06-22 11:20:17,649 INFO ]: Without dead ends: 116 [2018-06-22 11:20:17,649 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:20:17,649 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-22 11:20:17,683 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 110. [2018-06-22 11:20:17,683 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-22 11:20:17,687 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 521 transitions. [2018-06-22 11:20:17,688 INFO ]: Start accepts. Automaton has 110 states and 521 transitions. Word has length 37 [2018-06-22 11:20:17,688 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:17,688 INFO ]: Abstraction has 110 states and 521 transitions. [2018-06-22 11:20:17,688 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:20:17,688 INFO ]: Start isEmpty. Operand 110 states and 521 transitions. [2018-06-22 11:20:17,699 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:20:17,699 INFO ]: Found error trace [2018-06-22 11:20:17,699 INFO ]: trace histogram [6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:17,699 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:17,699 INFO ]: Analyzing trace with hash -1300736339, now seen corresponding path program 1 times [2018-06-22 11:20:17,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:17,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:17,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:17,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:17,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:17,720 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:17,790 INFO ]: Checked inductivity of 68 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:20:17,790 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:17,790 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:20:17,795 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:17,828 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:17,831 INFO ]: Computing forward predicates... [2018-06-22 11:20:17,987 INFO ]: Checked inductivity of 68 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 11:20:18,006 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:18,006 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:20:18,006 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:20:18,006 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:20:18,006 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:20:18,007 INFO ]: Start difference. First operand 110 states and 521 transitions. Second operand 14 states. [2018-06-22 11:20:18,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:18,522 INFO ]: Finished difference Result 175 states and 962 transitions. [2018-06-22 11:20:18,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:20:18,523 INFO ]: Start accepts. Automaton has 14 states. Word has length 53 [2018-06-22 11:20:18,523 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:18,529 INFO ]: With dead ends: 175 [2018-06-22 11:20:18,529 INFO ]: Without dead ends: 175 [2018-06-22 11:20:18,530 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:20:18,530 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-22 11:20:18,585 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 167. [2018-06-22 11:20:18,585 INFO ]: Start removeUnreachable. Operand 167 states. [2018-06-22 11:20:18,592 INFO ]: Finished removeUnreachable. Reduced from 167 states to 167 states and 928 transitions. [2018-06-22 11:20:18,592 INFO ]: Start accepts. Automaton has 167 states and 928 transitions. Word has length 53 [2018-06-22 11:20:18,592 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:18,592 INFO ]: Abstraction has 167 states and 928 transitions. [2018-06-22 11:20:18,592 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:20:18,592 INFO ]: Start isEmpty. Operand 167 states and 928 transitions. [2018-06-22 11:20:18,602 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:20:18,602 INFO ]: Found error trace [2018-06-22 11:20:18,602 INFO ]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:18,602 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:18,602 INFO ]: Analyzing trace with hash 2017043791, now seen corresponding path program 2 times [2018-06-22 11:20:18,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:18,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:18,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:18,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:18,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:18,616 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:19,191 INFO ]: Checked inductivity of 50 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:20:19,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:19,191 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) [2018-06-22 11:20:19,207 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:19,258 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:20:19,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:19,261 INFO ]: Computing forward predicates... [2018-06-22 11:20:19,831 INFO ]: Checked inductivity of 50 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:20:19,861 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:19,861 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 13 [2018-06-22 11:20:19,862 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:20:19,862 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:20:19,862 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:20:19,862 INFO ]: Start difference. First operand 167 states and 928 transitions. Second operand 13 states. [2018-06-22 11:20:20,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:20,540 INFO ]: Finished difference Result 299 states and 2286 transitions. [2018-06-22 11:20:20,577 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:20:20,577 INFO ]: Start accepts. Automaton has 13 states. Word has length 37 [2018-06-22 11:20:20,577 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:20,594 INFO ]: With dead ends: 299 [2018-06-22 11:20:20,594 INFO ]: Without dead ends: 298 [2018-06-22 11:20:20,595 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:20:20,595 INFO ]: Start minimizeSevpa. Operand 298 states. [2018-06-22 11:20:20,693 INFO ]: Finished minimizeSevpa. Reduced states from 298 to 148. [2018-06-22 11:20:20,693 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 11:20:20,698 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 702 transitions. [2018-06-22 11:20:20,698 INFO ]: Start accepts. Automaton has 148 states and 702 transitions. Word has length 37 [2018-06-22 11:20:20,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:20,698 INFO ]: Abstraction has 148 states and 702 transitions. [2018-06-22 11:20:20,698 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:20:20,698 INFO ]: Start isEmpty. Operand 148 states and 702 transitions. [2018-06-22 11:20:20,705 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:20:20,705 INFO ]: Found error trace [2018-06-22 11:20:20,705 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:20,705 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:20,705 INFO ]: Analyzing trace with hash 408612671, now seen corresponding path program 3 times [2018-06-22 11:20:20,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:20,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:20,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:20,707 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:20,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:20,720 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:20,856 INFO ]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:20:20,856 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:20,856 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:20:20,863 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:20:20,881 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:20:20,881 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:20,883 INFO ]: Computing forward predicates... [2018-06-22 11:20:20,930 INFO ]: Checked inductivity of 21 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:20:20,949 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:20,949 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-22 11:20:20,949 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:20:20,950 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:20:20,950 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:20:20,950 INFO ]: Start difference. First operand 148 states and 702 transitions. Second operand 12 states. [2018-06-22 11:20:21,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:21,687 INFO ]: Finished difference Result 228 states and 1567 transitions. [2018-06-22 11:20:21,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:20:21,688 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 11:20:21,688 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:21,696 INFO ]: With dead ends: 228 [2018-06-22 11:20:21,696 INFO ]: Without dead ends: 228 [2018-06-22 11:20:21,696 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:20:21,696 INFO ]: Start minimizeSevpa. Operand 228 states. [2018-06-22 11:20:21,766 INFO ]: Finished minimizeSevpa. Reduced states from 228 to 153. [2018-06-22 11:20:21,766 INFO ]: Start removeUnreachable. Operand 153 states. [2018-06-22 11:20:21,770 INFO ]: Finished removeUnreachable. Reduced from 153 states to 153 states and 854 transitions. [2018-06-22 11:20:21,770 INFO ]: Start accepts. Automaton has 153 states and 854 transitions. Word has length 29 [2018-06-22 11:20:21,770 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:21,770 INFO ]: Abstraction has 153 states and 854 transitions. [2018-06-22 11:20:21,770 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:20:21,770 INFO ]: Start isEmpty. Operand 153 states and 854 transitions. [2018-06-22 11:20:21,780 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:20:21,780 INFO ]: Found error trace [2018-06-22 11:20:21,780 INFO ]: trace histogram [14, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:21,780 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:21,781 INFO ]: Analyzing trace with hash -278434289, now seen corresponding path program 4 times [2018-06-22 11:20:21,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:21,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:21,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:21,781 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:21,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:21,800 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:22,518 INFO ]: Checked inductivity of 354 backedges. 44 proven. 84 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-06-22 11:20:22,518 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:22,518 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) [2018-06-22 11:20:22,532 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:22,597 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:20:22,597 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:22,601 INFO ]: Computing forward predicates... [2018-06-22 11:20:23,421 INFO ]: Checked inductivity of 354 backedges. 179 proven. 18 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-06-22 11:20:23,442 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:23,442 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 11:20:23,443 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:20:23,443 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:20:23,443 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:20:23,443 INFO ]: Start difference. First operand 153 states and 854 transitions. Second operand 15 states. [2018-06-22 11:20:24,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:24,080 INFO ]: Finished difference Result 183 states and 1095 transitions. [2018-06-22 11:20:24,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:20:24,080 INFO ]: Start accepts. Automaton has 15 states. Word has length 85 [2018-06-22 11:20:24,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:24,086 INFO ]: With dead ends: 183 [2018-06-22 11:20:24,086 INFO ]: Without dead ends: 183 [2018-06-22 11:20:24,086 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:20:24,086 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-22 11:20:24,131 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-06-22 11:20:24,132 INFO ]: Start removeUnreachable. Operand 172 states. [2018-06-22 11:20:24,136 INFO ]: Finished removeUnreachable. Reduced from 172 states to 172 states and 1017 transitions. [2018-06-22 11:20:24,136 INFO ]: Start accepts. Automaton has 172 states and 1017 transitions. Word has length 85 [2018-06-22 11:20:24,136 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:24,136 INFO ]: Abstraction has 172 states and 1017 transitions. [2018-06-22 11:20:24,136 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:20:24,136 INFO ]: Start isEmpty. Operand 172 states and 1017 transitions. [2018-06-22 11:20:24,146 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:20:24,146 INFO ]: Found error trace [2018-06-22 11:20:24,146 INFO ]: trace histogram [10, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:24,147 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:24,147 INFO ]: Analyzing trace with hash -1675528629, now seen corresponding path program 1 times [2018-06-22 11:20:24,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:24,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:24,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:24,147 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:24,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:24,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:24,721 INFO ]: Checked inductivity of 168 backedges. 48 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-22 11:20:24,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:24,721 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:20:24,729 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:24,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:24,769 INFO ]: Computing forward predicates... [2018-06-22 11:20:24,832 INFO ]: Checked inductivity of 168 backedges. 34 proven. 51 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-22 11:20:24,851 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:24,851 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 12 [2018-06-22 11:20:24,852 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:20:24,852 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:20:24,852 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:20:24,852 INFO ]: Start difference. First operand 172 states and 1017 transitions. Second operand 12 states. [2018-06-22 11:20:25,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:25,216 INFO ]: Finished difference Result 260 states and 1559 transitions. [2018-06-22 11:20:25,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:20:25,216 INFO ]: Start accepts. Automaton has 12 states. Word has length 69 [2018-06-22 11:20:25,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:25,242 INFO ]: With dead ends: 260 [2018-06-22 11:20:25,242 INFO ]: Without dead ends: 260 [2018-06-22 11:20:25,242 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:20:25,243 INFO ]: Start minimizeSevpa. Operand 260 states. [2018-06-22 11:20:25,296 INFO ]: Finished minimizeSevpa. Reduced states from 260 to 164. [2018-06-22 11:20:25,296 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-22 11:20:25,303 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 875 transitions. [2018-06-22 11:20:25,303 INFO ]: Start accepts. Automaton has 164 states and 875 transitions. Word has length 69 [2018-06-22 11:20:25,303 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:25,303 INFO ]: Abstraction has 164 states and 875 transitions. [2018-06-22 11:20:25,303 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:20:25,303 INFO ]: Start isEmpty. Operand 164 states and 875 transitions. [2018-06-22 11:20:25,314 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:20:25,314 INFO ]: Found error trace [2018-06-22 11:20:25,314 INFO ]: trace histogram [10, 5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:25,314 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:25,315 INFO ]: Analyzing trace with hash 527597581, now seen corresponding path program 1 times [2018-06-22 11:20:25,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:25,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:25,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:25,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:25,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:25,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:25,477 INFO ]: Checked inductivity of 165 backedges. 71 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-22 11:20:25,477 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:25,477 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:20:25,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:25,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:25,505 INFO ]: Computing forward predicates... [2018-06-22 11:20:25,676 INFO ]: Checked inductivity of 165 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-06-22 11:20:25,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:25,697 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14] total 19 [2018-06-22 11:20:25,697 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:20:25,697 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:20:25,697 INFO ]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:20:25,697 INFO ]: Start difference. First operand 164 states and 875 transitions. Second operand 19 states. [2018-06-22 11:20:26,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:26,591 INFO ]: Finished difference Result 213 states and 1133 transitions. [2018-06-22 11:20:26,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:20:26,592 INFO ]: Start accepts. Automaton has 19 states. Word has length 61 [2018-06-22 11:20:26,592 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:26,596 INFO ]: With dead ends: 213 [2018-06-22 11:20:26,596 INFO ]: Without dead ends: 213 [2018-06-22 11:20:26,597 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=281, Invalid=1201, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:20:26,597 INFO ]: Start minimizeSevpa. Operand 213 states. [2018-06-22 11:20:26,665 INFO ]: Finished minimizeSevpa. Reduced states from 213 to 169. [2018-06-22 11:20:26,666 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-22 11:20:26,670 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 921 transitions. [2018-06-22 11:20:26,670 INFO ]: Start accepts. Automaton has 169 states and 921 transitions. Word has length 61 [2018-06-22 11:20:26,670 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:26,670 INFO ]: Abstraction has 169 states and 921 transitions. [2018-06-22 11:20:26,670 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:20:26,670 INFO ]: Start isEmpty. Operand 169 states and 921 transitions. [2018-06-22 11:20:26,679 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:20:26,679 INFO ]: Found error trace [2018-06-22 11:20:26,679 INFO ]: trace histogram [8, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:26,680 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:26,680 INFO ]: Analyzing trace with hash -398853915, now seen corresponding path program 1 times [2018-06-22 11:20:26,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:26,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:26,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:26,680 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:26,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:26,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:26,794 INFO ]: Checked inductivity of 108 backedges. 34 proven. 16 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-06-22 11:20:26,794 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:26,794 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:20:26,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:26,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:26,828 INFO ]: Computing forward predicates... [2018-06-22 11:20:27,012 INFO ]: Checked inductivity of 108 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:20:27,030 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:27,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 19 [2018-06-22 11:20:27,031 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:20:27,031 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:20:27,031 INFO ]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:20:27,031 INFO ]: Start difference. First operand 169 states and 921 transitions. Second operand 19 states. [2018-06-22 11:20:27,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:27,964 INFO ]: Finished difference Result 267 states and 1632 transitions. [2018-06-22 11:20:27,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:20:27,964 INFO ]: Start accepts. Automaton has 19 states. Word has length 53 [2018-06-22 11:20:27,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:27,969 INFO ]: With dead ends: 267 [2018-06-22 11:20:27,969 INFO ]: Without dead ends: 267 [2018-06-22 11:20:27,970 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:20:27,970 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-22 11:20:28,066 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 221. [2018-06-22 11:20:28,066 INFO ]: Start removeUnreachable. Operand 221 states. [2018-06-22 11:20:28,074 INFO ]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1486 transitions. [2018-06-22 11:20:28,074 INFO ]: Start accepts. Automaton has 221 states and 1486 transitions. Word has length 53 [2018-06-22 11:20:28,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:28,074 INFO ]: Abstraction has 221 states and 1486 transitions. [2018-06-22 11:20:28,074 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:20:28,075 INFO ]: Start isEmpty. Operand 221 states and 1486 transitions. [2018-06-22 11:20:28,089 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:20:28,089 INFO ]: Found error trace [2018-06-22 11:20:28,089 INFO ]: trace histogram [14, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:28,090 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:28,090 INFO ]: Analyzing trace with hash 2116756845, now seen corresponding path program 2 times [2018-06-22 11:20:28,090 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:28,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:28,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:28,090 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:28,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:28,109 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:28,378 INFO ]: Checked inductivity of 324 backedges. 20 proven. 154 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-06-22 11:20:28,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:28,378 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:20:28,385 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:20:28,416 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:20:28,416 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:28,419 INFO ]: Computing forward predicates... [2018-06-22 11:20:28,594 INFO ]: Checked inductivity of 324 backedges. 151 proven. 70 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-22 11:20:28,614 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:28,614 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 20 [2018-06-22 11:20:28,614 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:20:28,614 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:20:28,614 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:20:28,614 INFO ]: Start difference. First operand 221 states and 1486 transitions. Second operand 20 states. [2018-06-22 11:20:29,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:29,425 INFO ]: Finished difference Result 257 states and 1482 transitions. [2018-06-22 11:20:29,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:20:29,425 INFO ]: Start accepts. Automaton has 20 states. Word has length 85 [2018-06-22 11:20:29,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:29,430 INFO ]: With dead ends: 257 [2018-06-22 11:20:29,430 INFO ]: Without dead ends: 257 [2018-06-22 11:20:29,431 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:20:29,431 INFO ]: Start minimizeSevpa. Operand 257 states. [2018-06-22 11:20:29,502 INFO ]: Finished minimizeSevpa. Reduced states from 257 to 218. [2018-06-22 11:20:29,502 INFO ]: Start removeUnreachable. Operand 218 states. [2018-06-22 11:20:29,510 INFO ]: Finished removeUnreachable. Reduced from 218 states to 218 states and 1305 transitions. [2018-06-22 11:20:29,510 INFO ]: Start accepts. Automaton has 218 states and 1305 transitions. Word has length 85 [2018-06-22 11:20:29,510 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:29,510 INFO ]: Abstraction has 218 states and 1305 transitions. [2018-06-22 11:20:29,510 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:20:29,510 INFO ]: Start isEmpty. Operand 218 states and 1305 transitions. [2018-06-22 11:20:29,521 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:20:29,521 INFO ]: Found error trace [2018-06-22 11:20:29,521 INFO ]: trace histogram [16, 8, 7, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:29,521 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:29,521 INFO ]: Analyzing trace with hash -2006106075, now seen corresponding path program 2 times [2018-06-22 11:20:29,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:29,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:29,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:29,522 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:29,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:29,534 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:29,858 INFO ]: Checked inductivity of 420 backedges. 114 proven. 4 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-06-22 11:20:29,858 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:29,858 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:20:29,867 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:20:29,900 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:20:29,900 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:29,904 INFO ]: Computing forward predicates... [2018-06-22 11:20:30,117 INFO ]: Checked inductivity of 420 backedges. 200 proven. 79 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-06-22 11:20:30,138 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:30,138 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2018-06-22 11:20:30,138 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:20:30,139 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:20:30,139 INFO ]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:20:30,139 INFO ]: Start difference. First operand 218 states and 1305 transitions. Second operand 18 states. [2018-06-22 11:20:30,803 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:30,803 INFO ]: Finished difference Result 303 states and 1600 transitions. [2018-06-22 11:20:30,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:20:30,830 INFO ]: Start accepts. Automaton has 18 states. Word has length 85 [2018-06-22 11:20:30,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:30,838 INFO ]: With dead ends: 303 [2018-06-22 11:20:30,838 INFO ]: Without dead ends: 303 [2018-06-22 11:20:30,839 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:20:30,839 INFO ]: Start minimizeSevpa. Operand 303 states. [2018-06-22 11:20:30,907 INFO ]: Finished minimizeSevpa. Reduced states from 303 to 229. [2018-06-22 11:20:30,907 INFO ]: Start removeUnreachable. Operand 229 states. [2018-06-22 11:20:30,917 INFO ]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1269 transitions. [2018-06-22 11:20:30,917 INFO ]: Start accepts. Automaton has 229 states and 1269 transitions. Word has length 85 [2018-06-22 11:20:30,917 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:30,917 INFO ]: Abstraction has 229 states and 1269 transitions. [2018-06-22 11:20:30,917 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:20:30,917 INFO ]: Start isEmpty. Operand 229 states and 1269 transitions. [2018-06-22 11:20:30,928 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:20:30,928 INFO ]: Found error trace [2018-06-22 11:20:30,928 INFO ]: trace histogram [12, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:30,929 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:30,929 INFO ]: Analyzing trace with hash 1585679709, now seen corresponding path program 3 times [2018-06-22 11:20:30,929 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:30,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:30,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:30,929 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:30,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:30,940 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:31,415 INFO ]: Checked inductivity of 239 backedges. 66 proven. 58 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-06-22 11:20:31,415 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:31,415 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:20:31,423 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:20:31,441 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:20:31,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:31,444 INFO ]: Computing forward predicates... [2018-06-22 11:20:31,633 INFO ]: Checked inductivity of 239 backedges. 74 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-06-22 11:20:31,653 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:31,653 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-22 11:20:31,653 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:20:31,653 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:20:31,653 INFO ]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:20:31,653 INFO ]: Start difference. First operand 229 states and 1269 transitions. Second operand 25 states. [2018-06-22 11:20:32,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:32,490 INFO ]: Finished difference Result 328 states and 1749 transitions. [2018-06-22 11:20:32,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:20:32,490 INFO ]: Start accepts. Automaton has 25 states. Word has length 77 [2018-06-22 11:20:32,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:32,496 INFO ]: With dead ends: 328 [2018-06-22 11:20:32,496 INFO ]: Without dead ends: 325 [2018-06-22 11:20:32,496 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=310, Invalid=1852, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:20:32,496 INFO ]: Start minimizeSevpa. Operand 325 states. [2018-06-22 11:20:32,553 INFO ]: Finished minimizeSevpa. Reduced states from 325 to 215. [2018-06-22 11:20:32,554 INFO ]: Start removeUnreachable. Operand 215 states. [2018-06-22 11:20:32,558 INFO ]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1100 transitions. [2018-06-22 11:20:32,558 INFO ]: Start accepts. Automaton has 215 states and 1100 transitions. Word has length 77 [2018-06-22 11:20:32,559 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:32,559 INFO ]: Abstraction has 215 states and 1100 transitions. [2018-06-22 11:20:32,559 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:20:32,559 INFO ]: Start isEmpty. Operand 215 states and 1100 transitions. [2018-06-22 11:20:32,569 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:20:32,569 INFO ]: Found error trace [2018-06-22 11:20:32,569 INFO ]: trace histogram [20, 10, 9, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:32,569 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:32,569 INFO ]: Analyzing trace with hash -1889303617, now seen corresponding path program 5 times [2018-06-22 11:20:32,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:32,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:32,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:32,571 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:32,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:32,587 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:33,574 INFO ]: Checked inductivity of 645 backedges. 30 proven. 329 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-06-22 11:20:33,574 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:33,574 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:20:33,580 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:20:33,615 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-22 11:20:33,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:33,618 INFO ]: Computing forward predicates... [2018-06-22 11:20:33,823 INFO ]: Checked inductivity of 645 backedges. 325 proven. 114 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-06-22 11:20:33,842 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:33,842 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-22 11:20:33,842 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:20:33,842 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:20:33,843 INFO ]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:20:33,843 INFO ]: Start difference. First operand 215 states and 1100 transitions. Second operand 26 states. [2018-06-22 11:20:36,066 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 11:20:36,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:36,342 INFO ]: Finished difference Result 331 states and 1610 transitions. [2018-06-22 11:20:36,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 11:20:36,342 INFO ]: Start accepts. Automaton has 26 states. Word has length 93 [2018-06-22 11:20:36,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:36,348 INFO ]: With dead ends: 331 [2018-06-22 11:20:36,348 INFO ]: Without dead ends: 331 [2018-06-22 11:20:36,349 INFO ]: 0 DeclaredPredicates, 175 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1164, Invalid=5642, Unknown=0, NotChecked=0, Total=6806 [2018-06-22 11:20:36,349 INFO ]: Start minimizeSevpa. Operand 331 states. [2018-06-22 11:20:36,424 INFO ]: Finished minimizeSevpa. Reduced states from 331 to 243. [2018-06-22 11:20:36,424 INFO ]: Start removeUnreachable. Operand 243 states. [2018-06-22 11:20:36,429 INFO ]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1324 transitions. [2018-06-22 11:20:36,429 INFO ]: Start accepts. Automaton has 243 states and 1324 transitions. Word has length 93 [2018-06-22 11:20:36,430 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:36,430 INFO ]: Abstraction has 243 states and 1324 transitions. [2018-06-22 11:20:36,430 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:20:36,430 INFO ]: Start isEmpty. Operand 243 states and 1324 transitions. [2018-06-22 11:20:36,441 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 11:20:36,441 INFO ]: Found error trace [2018-06-22 11:20:36,441 INFO ]: trace histogram [22, 10, 10, 10, 10, 10, 8, 8, 7, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:36,441 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:36,442 INFO ]: Analyzing trace with hash 1933871915, now seen corresponding path program 2 times [2018-06-22 11:20:36,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:36,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:36,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:36,442 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:36,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:36,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:36,683 INFO ]: Checked inductivity of 876 backedges. 48 proven. 184 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2018-06-22 11:20:36,683 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:36,683 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:20:36,688 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:20:36,737 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:20:36,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:36,741 INFO ]: Computing forward predicates... [2018-06-22 11:20:36,850 INFO ]: Checked inductivity of 876 backedges. 479 proven. 69 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2018-06-22 11:20:36,882 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:36,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 11:20:36,883 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:20:36,883 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:20:36,883 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:20:36,883 INFO ]: Start difference. First operand 243 states and 1324 transitions. Second operand 15 states. [2018-06-22 11:20:37,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:37,440 INFO ]: Finished difference Result 336 states and 1363 transitions. [2018-06-22 11:20:37,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:20:37,440 INFO ]: Start accepts. Automaton has 15 states. Word has length 133 [2018-06-22 11:20:37,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:37,444 INFO ]: With dead ends: 336 [2018-06-22 11:20:37,444 INFO ]: Without dead ends: 290 [2018-06-22 11:20:37,444 INFO ]: 0 DeclaredPredicates, 158 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=789, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:20:37,444 INFO ]: Start minimizeSevpa. Operand 290 states. [2018-06-22 11:20:37,526 INFO ]: Finished minimizeSevpa. Reduced states from 290 to 232. [2018-06-22 11:20:37,526 INFO ]: Start removeUnreachable. Operand 232 states. [2018-06-22 11:20:37,530 INFO ]: Finished removeUnreachable. Reduced from 232 states to 232 states and 889 transitions. [2018-06-22 11:20:37,530 INFO ]: Start accepts. Automaton has 232 states and 889 transitions. Word has length 133 [2018-06-22 11:20:37,530 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:37,530 INFO ]: Abstraction has 232 states and 889 transitions. [2018-06-22 11:20:37,530 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:20:37,530 INFO ]: Start isEmpty. Operand 232 states and 889 transitions. [2018-06-22 11:20:37,543 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 11:20:37,543 INFO ]: Found error trace [2018-06-22 11:20:37,543 INFO ]: trace histogram [18, 16, 12, 8, 8, 8, 8, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:37,543 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:37,543 INFO ]: Analyzing trace with hash -2134140025, now seen corresponding path program 3 times [2018-06-22 11:20:37,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:37,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:37,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:37,544 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:37,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:37,559 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:38,342 INFO ]: Checked inductivity of 899 backedges. 70 proven. 173 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-06-22 11:20:38,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:38,342 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:20:38,347 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:20:38,386 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:20:38,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:38,389 INFO ]: Computing forward predicates... [2018-06-22 11:20:38,681 INFO ]: Checked inductivity of 899 backedges. 371 proven. 88 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-06-22 11:20:38,700 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:38,700 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22] total 29 [2018-06-22 11:20:38,700 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:20:38,701 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:20:38,701 INFO ]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:20:38,701 INFO ]: Start difference. First operand 232 states and 889 transitions. Second operand 29 states. [2018-06-22 11:20:40,459 WARN ]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 11:20:41,007 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:41,007 INFO ]: Finished difference Result 373 states and 1366 transitions. [2018-06-22 11:20:41,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:20:41,008 INFO ]: Start accepts. Automaton has 29 states. Word has length 141 [2018-06-22 11:20:41,009 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:41,025 INFO ]: With dead ends: 373 [2018-06-22 11:20:41,025 INFO ]: Without dead ends: 373 [2018-06-22 11:20:41,026 INFO ]: 0 DeclaredPredicates, 179 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=369, Invalid=2601, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:20:41,027 INFO ]: Start minimizeSevpa. Operand 373 states. [2018-06-22 11:20:41,123 INFO ]: Finished minimizeSevpa. Reduced states from 373 to 260. [2018-06-22 11:20:41,123 INFO ]: Start removeUnreachable. Operand 260 states. [2018-06-22 11:20:41,128 INFO ]: Finished removeUnreachable. Reduced from 260 states to 260 states and 962 transitions. [2018-06-22 11:20:41,128 INFO ]: Start accepts. Automaton has 260 states and 962 transitions. Word has length 141 [2018-06-22 11:20:41,128 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:41,128 INFO ]: Abstraction has 260 states and 962 transitions. [2018-06-22 11:20:41,128 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:20:41,128 INFO ]: Start isEmpty. Operand 260 states and 962 transitions. [2018-06-22 11:20:41,136 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:20:41,136 INFO ]: Found error trace [2018-06-22 11:20:41,136 INFO ]: trace histogram [8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:41,136 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:41,137 INFO ]: Analyzing trace with hash -580716477, now seen corresponding path program 1 times [2018-06-22 11:20:41,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:41,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:41,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:41,137 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:41,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:41,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:41,335 INFO ]: Checked inductivity of 126 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:20:41,335 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:41,335 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:20:41,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:41,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:41,364 INFO ]: Computing forward predicates... [2018-06-22 11:20:41,508 INFO ]: Checked inductivity of 126 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-22 11:20:41,527 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:41,527 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-06-22 11:20:41,527 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:20:41,527 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:20:41,527 INFO ]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:20:41,528 INFO ]: Start difference. First operand 260 states and 962 transitions. Second operand 23 states. [2018-06-22 11:20:42,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:42,445 INFO ]: Finished difference Result 281 states and 1005 transitions. [2018-06-22 11:20:42,445 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:20:42,445 INFO ]: Start accepts. Automaton has 23 states. Word has length 69 [2018-06-22 11:20:42,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:42,450 INFO ]: With dead ends: 281 [2018-06-22 11:20:42,450 INFO ]: Without dead ends: 281 [2018-06-22 11:20:42,451 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:20:42,451 INFO ]: Start minimizeSevpa. Operand 281 states. [2018-06-22 11:20:42,488 INFO ]: Finished minimizeSevpa. Reduced states from 281 to 265. [2018-06-22 11:20:42,488 INFO ]: Start removeUnreachable. Operand 265 states. [2018-06-22 11:20:42,492 INFO ]: Finished removeUnreachable. Reduced from 265 states to 265 states and 972 transitions. [2018-06-22 11:20:42,492 INFO ]: Start accepts. Automaton has 265 states and 972 transitions. Word has length 69 [2018-06-22 11:20:42,493 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:42,493 INFO ]: Abstraction has 265 states and 972 transitions. [2018-06-22 11:20:42,493 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:20:42,493 INFO ]: Start isEmpty. Operand 265 states and 972 transitions. [2018-06-22 11:20:42,502 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 11:20:42,502 INFO ]: Found error trace [2018-06-22 11:20:42,502 INFO ]: trace histogram [24, 12, 11, 11, 11, 11, 11, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:42,502 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:42,502 INFO ]: Analyzing trace with hash -2091415701, now seen corresponding path program 4 times [2018-06-22 11:20:42,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:42,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:42,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:42,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:42,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:42,519 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:42,760 INFO ]: Checked inductivity of 985 backedges. 204 proven. 12 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2018-06-22 11:20:42,760 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:42,760 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:20:42,765 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:20:42,812 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:20:42,812 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:42,816 INFO ]: Computing forward predicates... [2018-06-22 11:20:42,943 INFO ]: Checked inductivity of 985 backedges. 364 proven. 53 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2018-06-22 11:20:42,962 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:42,962 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 19 [2018-06-22 11:20:42,963 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:20:42,963 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:20:42,963 INFO ]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:20:42,963 INFO ]: Start difference. First operand 265 states and 972 transitions. Second operand 19 states. [2018-06-22 11:20:46,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:46,513 INFO ]: Finished difference Result 829 states and 5150 transitions. [2018-06-22 11:20:46,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 11:20:46,564 INFO ]: Start accepts. Automaton has 19 states. Word has length 125 [2018-06-22 11:20:46,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:46,595 INFO ]: With dead ends: 829 [2018-06-22 11:20:46,595 INFO ]: Without dead ends: 829 [2018-06-22 11:20:46,596 INFO ]: 0 DeclaredPredicates, 188 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=488, Invalid=2934, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 11:20:46,596 INFO ]: Start minimizeSevpa. Operand 829 states. [2018-06-22 11:20:46,806 INFO ]: Finished minimizeSevpa. Reduced states from 829 to 273. [2018-06-22 11:20:46,806 INFO ]: Start removeUnreachable. Operand 273 states. [2018-06-22 11:20:46,810 INFO ]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1008 transitions. [2018-06-22 11:20:46,810 INFO ]: Start accepts. Automaton has 273 states and 1008 transitions. Word has length 125 [2018-06-22 11:20:46,810 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:46,810 INFO ]: Abstraction has 273 states and 1008 transitions. [2018-06-22 11:20:46,810 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:20:46,810 INFO ]: Start isEmpty. Operand 273 states and 1008 transitions. [2018-06-22 11:20:46,817 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:20:46,817 INFO ]: Found error trace [2018-06-22 11:20:46,817 INFO ]: trace histogram [24, 12, 11, 11, 11, 11, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:46,817 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:46,818 INFO ]: Analyzing trace with hash 1333939423, now seen corresponding path program 6 times [2018-06-22 11:20:46,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:46,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:46,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:46,818 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:46,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:46,834 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:47,082 INFO ]: Checked inductivity of 941 backedges. 298 proven. 220 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2018-06-22 11:20:47,082 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:47,082 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:20:47,089 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:20:47,154 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-22 11:20:47,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:47,159 INFO ]: Computing forward predicates... [2018-06-22 11:20:47,307 INFO ]: Checked inductivity of 941 backedges. 461 proven. 190 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-06-22 11:20:47,326 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:47,326 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 23 [2018-06-22 11:20:47,326 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:20:47,326 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:20:47,327 INFO ]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:20:47,327 INFO ]: Start difference. First operand 273 states and 1008 transitions. Second operand 23 states. [2018-06-22 11:20:48,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:48,227 INFO ]: Finished difference Result 341 states and 1284 transitions. [2018-06-22 11:20:48,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:20:48,227 INFO ]: Start accepts. Automaton has 23 states. Word has length 109 [2018-06-22 11:20:48,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:48,231 INFO ]: With dead ends: 341 [2018-06-22 11:20:48,231 INFO ]: Without dead ends: 341 [2018-06-22 11:20:48,232 INFO ]: 0 DeclaredPredicates, 166 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=541, Invalid=1811, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:20:48,232 INFO ]: Start minimizeSevpa. Operand 341 states. [2018-06-22 11:20:48,281 INFO ]: Finished minimizeSevpa. Reduced states from 341 to 291. [2018-06-22 11:20:48,281 INFO ]: Start removeUnreachable. Operand 291 states. [2018-06-22 11:20:48,284 INFO ]: Finished removeUnreachable. Reduced from 291 states to 291 states and 1182 transitions. [2018-06-22 11:20:48,284 INFO ]: Start accepts. Automaton has 291 states and 1182 transitions. Word has length 109 [2018-06-22 11:20:48,284 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:48,284 INFO ]: Abstraction has 291 states and 1182 transitions. [2018-06-22 11:20:48,284 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:20:48,284 INFO ]: Start isEmpty. Operand 291 states and 1182 transitions. [2018-06-22 11:20:48,289 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 11:20:48,289 INFO ]: Found error trace [2018-06-22 11:20:48,289 INFO ]: trace histogram [30, 16, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:48,289 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:48,289 INFO ]: Analyzing trace with hash -1492830385, now seen corresponding path program 2 times [2018-06-22 11:20:48,289 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:48,289 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:48,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:48,290 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:48,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:48,319 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:48,704 INFO ]: Checked inductivity of 1487 backedges. 50 proven. 724 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2018-06-22 11:20:48,704 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:48,704 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:20:48,710 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:20:48,758 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:20:48,758 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:48,762 INFO ]: Computing forward predicates... [2018-06-22 11:20:50,069 INFO ]: Checked inductivity of 1487 backedges. 783 proven. 192 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-06-22 11:20:50,088 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:50,088 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-06-22 11:20:50,088 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:20:50,088 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:20:50,089 INFO ]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:20:50,089 INFO ]: Start difference. First operand 291 states and 1182 transitions. Second operand 30 states. [2018-06-22 11:20:52,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:52,490 INFO ]: Finished difference Result 380 states and 1386 transitions. [2018-06-22 11:20:52,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-22 11:20:52,491 INFO ]: Start accepts. Automaton has 30 states. Word has length 125 [2018-06-22 11:20:52,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:52,496 INFO ]: With dead ends: 380 [2018-06-22 11:20:52,496 INFO ]: Without dead ends: 380 [2018-06-22 11:20:52,498 INFO ]: 0 DeclaredPredicates, 223 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2123 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1438, Invalid=7304, Unknown=0, NotChecked=0, Total=8742 [2018-06-22 11:20:52,498 INFO ]: Start minimizeSevpa. Operand 380 states. [2018-06-22 11:20:52,581 INFO ]: Finished minimizeSevpa. Reduced states from 380 to 331. [2018-06-22 11:20:52,581 INFO ]: Start removeUnreachable. Operand 331 states. [2018-06-22 11:20:52,584 INFO ]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1256 transitions. [2018-06-22 11:20:52,584 INFO ]: Start accepts. Automaton has 331 states and 1256 transitions. Word has length 125 [2018-06-22 11:20:52,585 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:52,585 INFO ]: Abstraction has 331 states and 1256 transitions. [2018-06-22 11:20:52,585 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:20:52,585 INFO ]: Start isEmpty. Operand 331 states and 1256 transitions. [2018-06-22 11:20:52,588 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:20:52,588 INFO ]: Found error trace [2018-06-22 11:20:52,588 INFO ]: trace histogram [10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:52,588 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:52,588 INFO ]: Analyzing trace with hash 523003091, now seen corresponding path program 2 times [2018-06-22 11:20:52,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:52,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:52,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:52,589 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:52,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:52,603 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:52,740 INFO ]: Checked inductivity of 183 backedges. 54 proven. 18 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-22 11:20:52,740 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:52,740 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:52,746 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:20:52,771 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:20:52,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:52,774 INFO ]: Computing forward predicates... [2018-06-22 11:20:52,917 INFO ]: Checked inductivity of 183 backedges. 27 proven. 60 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-22 11:20:52,936 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:52,936 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-06-22 11:20:52,936 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:20:52,936 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:20:52,937 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:20:52,937 INFO ]: Start difference. First operand 331 states and 1256 transitions. Second operand 17 states. [2018-06-22 11:20:53,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:53,599 INFO ]: Finished difference Result 412 states and 1555 transitions. [2018-06-22 11:20:53,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:20:53,599 INFO ]: Start accepts. Automaton has 17 states. Word has length 77 [2018-06-22 11:20:53,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:53,604 INFO ]: With dead ends: 412 [2018-06-22 11:20:53,604 INFO ]: Without dead ends: 412 [2018-06-22 11:20:53,604 INFO ]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:20:53,605 INFO ]: Start minimizeSevpa. Operand 412 states. [2018-06-22 11:20:53,654 INFO ]: Finished minimizeSevpa. Reduced states from 412 to 331. [2018-06-22 11:20:53,654 INFO ]: Start removeUnreachable. Operand 331 states. [2018-06-22 11:20:53,659 INFO ]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1248 transitions. [2018-06-22 11:20:53,659 INFO ]: Start accepts. Automaton has 331 states and 1248 transitions. Word has length 77 [2018-06-22 11:20:53,660 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:53,660 INFO ]: Abstraction has 331 states and 1248 transitions. [2018-06-22 11:20:53,660 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:20:53,660 INFO ]: Start isEmpty. Operand 331 states and 1248 transitions. [2018-06-22 11:20:53,666 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 11:20:53,666 INFO ]: Found error trace [2018-06-22 11:20:53,666 INFO ]: trace histogram [30, 15, 14, 14, 14, 14, 14, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:53,666 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:53,666 INFO ]: Analyzing trace with hash 1355850133, now seen corresponding path program 5 times [2018-06-22 11:20:53,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:53,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:53,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:53,667 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:53,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:53,686 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:53,987 INFO ]: Checked inductivity of 1505 backedges. 40 proven. 734 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2018-06-22 11:20:53,987 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:53,987 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:53,994 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:20:54,056 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-06-22 11:20:54,056 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:54,061 INFO ]: Computing forward predicates... [2018-06-22 11:20:54,168 INFO ]: Checked inductivity of 1505 backedges. 773 proven. 202 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2018-06-22 11:20:54,188 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:54,188 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-22 11:20:54,188 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:20:54,188 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:20:54,188 INFO ]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:20:54,188 INFO ]: Start difference. First operand 331 states and 1248 transitions. Second operand 17 states. [2018-06-22 11:20:54,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:54,528 INFO ]: Finished difference Result 363 states and 1385 transitions. [2018-06-22 11:20:54,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:20:54,529 INFO ]: Start accepts. Automaton has 17 states. Word has length 141 [2018-06-22 11:20:54,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:54,535 INFO ]: With dead ends: 363 [2018-06-22 11:20:54,535 INFO ]: Without dead ends: 363 [2018-06-22 11:20:54,536 INFO ]: 0 DeclaredPredicates, 188 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:20:54,536 INFO ]: Start minimizeSevpa. Operand 363 states. [2018-06-22 11:20:54,607 INFO ]: Finished minimizeSevpa. Reduced states from 363 to 349. [2018-06-22 11:20:54,607 INFO ]: Start removeUnreachable. Operand 349 states. [2018-06-22 11:20:54,611 INFO ]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1364 transitions. [2018-06-22 11:20:54,611 INFO ]: Start accepts. Automaton has 349 states and 1364 transitions. Word has length 141 [2018-06-22 11:20:54,611 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:54,611 INFO ]: Abstraction has 349 states and 1364 transitions. [2018-06-22 11:20:54,611 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:20:54,611 INFO ]: Start isEmpty. Operand 349 states and 1364 transitions. [2018-06-22 11:20:54,615 INFO ]: Finished isEmpty. Found accepting run of length 166 [2018-06-22 11:20:54,615 INFO ]: Found error trace [2018-06-22 11:20:54,615 INFO ]: trace histogram [32, 15, 15, 15, 15, 15, 14, 6, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:54,616 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:54,616 INFO ]: Analyzing trace with hash -1582944325, now seen corresponding path program 3 times [2018-06-22 11:20:54,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:54,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:54,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:54,616 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:54,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:54,639 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:54,847 INFO ]: Checked inductivity of 1748 backedges. 115 proven. 706 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2018-06-22 11:20:54,847 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:54,847 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:54,872 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:20:54,928 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-22 11:20:54,928 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:54,932 INFO ]: Computing forward predicates... [2018-06-22 11:20:55,162 INFO ]: Checked inductivity of 1748 backedges. 464 proven. 34 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-06-22 11:20:55,182 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:55,182 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-06-22 11:20:55,182 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:20:55,182 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:20:55,182 INFO ]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:20:55,183 INFO ]: Start difference. First operand 349 states and 1364 transitions. Second operand 27 states. [2018-06-22 11:20:56,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:56,241 INFO ]: Finished difference Result 361 states and 1026 transitions. [2018-06-22 11:20:56,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 11:20:56,241 INFO ]: Start accepts. Automaton has 27 states. Word has length 165 [2018-06-22 11:20:56,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:56,245 INFO ]: With dead ends: 361 [2018-06-22 11:20:56,245 INFO ]: Without dead ends: 361 [2018-06-22 11:20:56,246 INFO ]: 0 DeclaredPredicates, 225 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=391, Invalid=2801, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:20:56,247 INFO ]: Start minimizeSevpa. Operand 361 states. [2018-06-22 11:20:56,274 INFO ]: Finished minimizeSevpa. Reduced states from 361 to 313. [2018-06-22 11:20:56,274 INFO ]: Start removeUnreachable. Operand 313 states. [2018-06-22 11:20:56,278 INFO ]: Finished removeUnreachable. Reduced from 313 states to 313 states and 922 transitions. [2018-06-22 11:20:56,278 INFO ]: Start accepts. Automaton has 313 states and 922 transitions. Word has length 165 [2018-06-22 11:20:56,279 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:56,279 INFO ]: Abstraction has 313 states and 922 transitions. [2018-06-22 11:20:56,279 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:20:56,279 INFO ]: Start isEmpty. Operand 313 states and 922 transitions. [2018-06-22 11:20:56,284 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:20:56,284 INFO ]: Found error trace [2018-06-22 11:20:56,284 INFO ]: trace histogram [12, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:56,284 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:56,284 INFO ]: Analyzing trace with hash 1429383787, now seen corresponding path program 3 times [2018-06-22 11:20:56,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:56,284 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:56,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:56,285 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:56,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:56,295 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:56,458 INFO ]: Checked inductivity of 283 backedges. 70 proven. 18 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-06-22 11:20:56,458 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:56,459 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:56,464 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:20:56,510 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 11:20:56,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:56,513 INFO ]: Computing forward predicates... [2018-06-22 11:20:56,700 INFO ]: Checked inductivity of 283 backedges. 72 proven. 59 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-06-22 11:20:56,719 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:56,719 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 25 [2018-06-22 11:20:56,719 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:20:56,720 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:20:56,720 INFO ]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:20:56,720 INFO ]: Start difference. First operand 313 states and 922 transitions. Second operand 25 states. [2018-06-22 11:20:57,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:57,973 INFO ]: Finished difference Result 362 states and 1046 transitions. [2018-06-22 11:20:57,973 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 11:20:57,973 INFO ]: Start accepts. Automaton has 25 states. Word has length 93 [2018-06-22 11:20:57,973 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:57,977 INFO ]: With dead ends: 362 [2018-06-22 11:20:57,977 INFO ]: Without dead ends: 361 [2018-06-22 11:20:57,978 INFO ]: 0 DeclaredPredicates, 159 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=292, Invalid=2464, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 11:20:57,978 INFO ]: Start minimizeSevpa. Operand 361 states. [2018-06-22 11:20:57,997 INFO ]: Finished minimizeSevpa. Reduced states from 361 to 317. [2018-06-22 11:20:57,997 INFO ]: Start removeUnreachable. Operand 317 states. [2018-06-22 11:20:58,002 INFO ]: Finished removeUnreachable. Reduced from 317 states to 317 states and 946 transitions. [2018-06-22 11:20:58,002 INFO ]: Start accepts. Automaton has 317 states and 946 transitions. Word has length 93 [2018-06-22 11:20:58,002 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:58,002 INFO ]: Abstraction has 317 states and 946 transitions. [2018-06-22 11:20:58,002 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:20:58,002 INFO ]: Start isEmpty. Operand 317 states and 946 transitions. [2018-06-22 11:20:58,007 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 11:20:58,007 INFO ]: Found error trace [2018-06-22 11:20:58,007 INFO ]: trace histogram [34, 18, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:58,007 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:58,007 INFO ]: Analyzing trace with hash -1687605905, now seen corresponding path program 3 times [2018-06-22 11:20:58,007 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:58,007 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:58,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:58,008 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:58,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:58,027 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:58,274 INFO ]: Checked inductivity of 1923 backedges. 45 proven. 944 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2018-06-22 11:20:58,275 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:58,275 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:58,280 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:20:58,322 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-06-22 11:20:58,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:58,325 INFO ]: Computing forward predicates... [2018-06-22 11:20:58,595 INFO ]: Checked inductivity of 1923 backedges. 482 proven. 28 refuted. 0 times theorem prover too weak. 1413 trivial. 0 not checked. [2018-06-22 11:20:58,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:58,613 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 23 [2018-06-22 11:20:58,614 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:20:58,614 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:20:58,614 INFO ]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:20:58,614 INFO ]: Start difference. First operand 317 states and 946 transitions. Second operand 23 states. [2018-06-22 11:20:59,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:59,783 INFO ]: Finished difference Result 364 states and 1051 transitions. [2018-06-22 11:20:59,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 11:20:59,784 INFO ]: Start accepts. Automaton has 23 states. Word has length 141 [2018-06-22 11:20:59,784 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:59,787 INFO ]: With dead ends: 364 [2018-06-22 11:20:59,787 INFO ]: Without dead ends: 363 [2018-06-22 11:20:59,788 INFO ]: 0 DeclaredPredicates, 218 GetRequests, 151 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=888, Invalid=2894, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 11:20:59,788 INFO ]: Start minimizeSevpa. Operand 363 states. [2018-06-22 11:20:59,808 INFO ]: Finished minimizeSevpa. Reduced states from 363 to 314. [2018-06-22 11:20:59,808 INFO ]: Start removeUnreachable. Operand 314 states. [2018-06-22 11:20:59,812 INFO ]: Finished removeUnreachable. Reduced from 314 states to 314 states and 921 transitions. [2018-06-22 11:20:59,812 INFO ]: Start accepts. Automaton has 314 states and 921 transitions. Word has length 141 [2018-06-22 11:20:59,812 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:59,812 INFO ]: Abstraction has 314 states and 921 transitions. [2018-06-22 11:20:59,812 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:20:59,812 INFO ]: Start isEmpty. Operand 314 states and 921 transitions. [2018-06-22 11:20:59,817 INFO ]: Finished isEmpty. Found accepting run of length 214 [2018-06-22 11:20:59,817 INFO ]: Found error trace [2018-06-22 11:20:59,817 INFO ]: trace histogram [32, 20, 19, 15, 15, 15, 15, 15, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:59,817 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:59,818 INFO ]: Analyzing trace with hash 267795181, now seen corresponding path program 2 times [2018-06-22 11:20:59,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:59,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:59,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:59,818 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:59,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:59,838 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:59,977 INFO ]: Checked inductivity of 2340 backedges. 225 proven. 338 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-06-22 11:20:59,977 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:59,977 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:59,982 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:21:00,095 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:21:00,095 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:21:00,103 INFO ]: Computing forward predicates... [2018-06-22 11:21:00,361 INFO ]: Checked inductivity of 2340 backedges. 1011 proven. 202 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2018-06-22 11:21:00,379 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:21:00,379 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16] total 22 [2018-06-22 11:21:00,380 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:21:00,380 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:21:00,380 INFO ]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:21:00,380 INFO ]: Start difference. First operand 314 states and 921 transitions. Second operand 22 states. Received shutdown request... [2018-06-22 11:21:01,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 11:21:01,330 WARN ]: Verification canceled [2018-06-22 11:21:01,334 WARN ]: Timeout [2018-06-22 11:21:01,334 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:21:01 BoogieIcfgContainer [2018-06-22 11:21:01,334 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:21:01,335 INFO ]: Toolchain (without parser) took 54587.70 ms. Allocated memory was 301.5 MB in the beginning and 854.1 MB in the end (delta: 552.6 MB). Free memory was 257.0 MB in the beginning and 821.8 MB in the end (delta: -564.8 MB). Peak memory consumption was 96.8 MB. Max. memory is 3.6 GB. [2018-06-22 11:21:01,336 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 301.5 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:21:01,336 INFO ]: ChcToBoogie took 56.42 ms. Allocated memory is still 301.5 MB. Free memory was 257.0 MB in the beginning and 255.0 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:21:01,336 INFO ]: Boogie Preprocessor took 43.30 ms. Allocated memory is still 301.5 MB. Free memory was 255.0 MB in the beginning and 253.0 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:21:01,337 INFO ]: RCFGBuilder took 371.54 ms. Allocated memory is still 301.5 MB. Free memory was 253.0 MB in the beginning and 243.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:21:01,337 INFO ]: TraceAbstraction took 54106.32 ms. Allocated memory was 301.5 MB in the beginning and 854.1 MB in the end (delta: 552.6 MB). Free memory was 243.0 MB in the beginning and 821.8 MB in the end (delta: -578.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 3.6 GB. [2018-06-22 11:21:01,339 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 301.5 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.42 ms. Allocated memory is still 301.5 MB. Free memory was 257.0 MB in the beginning and 255.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.30 ms. Allocated memory is still 301.5 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 371.54 ms. Allocated memory is still 301.5 MB. Free memory was 253.0 MB in the beginning and 243.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54106.32 ms. Allocated memory was 301.5 MB in the beginning and 854.1 MB in the end (delta: 552.6 MB). Free memory was 243.0 MB in the beginning and 821.8 MB in the end (delta: -578.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (314states) and interpolant automaton (currently 35 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. TIMEOUT Result, 54.0s OverallTime, 32 OverallIterations, 34 TraceHistogramMax, 30.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1354 SDtfs, 996 SDslu, 13015 SDs, 0 SdLazy, 20131 SolverSat, 5180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3675 GetRequests, 2531 SyntacticMatches, 26 SemanticMatches, 1117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9798 ImplicationChecksByTransitivity, 28.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=28, 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: 1.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 1925 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 5003 NumberOfCodeBlocks, 4729 NumberOfCodeBlocksAsserted, 172 NumberOfCheckSat, 4940 ConstructedInterpolants, 0 QuantifiedInterpolants, 1104004 SizeOfPredicates, 332 NumberOfNonLiveVariables, 8919 ConjunctsInSsa, 927 ConjunctsInUnsatCore, 63 InterpolantComputations, 3 PerfectInterpolantSequences, 25545/32246 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/021-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-21-01-347.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/021-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-21-01-347.csv Completed graceful shutdown