java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:53:11,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:53:11,290 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:53:11,303 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:53:11,304 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:53:11,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:53:11,308 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:53:11,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:53:11,312 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:53:11,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:53:11,314 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:53:11,315 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:53:11,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:53:11,316 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:53:11,317 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:53:11,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:53:11,322 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:53:11,324 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:53:11,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:53:11,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:53:11,336 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:53:11,338 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:53:11,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:53:11,338 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:53:11,339 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:53:11,340 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:53:11,341 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:53:11,341 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:53:11,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:53:11,342 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:53:11,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:53:11,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:53:11,344 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:53:11,345 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:53:11,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:53:11,346 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:53:11,365 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:53:11,365 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:53:11,365 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:53:11,366 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:53:11,368 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:53:11,369 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:53:11,369 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:53:11,369 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:53:11,369 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:53:11,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:53:11,370 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:53:11,370 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:53:11,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:53:11,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:53:11,371 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:53:11,372 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:53:11,372 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:53:11,372 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:53:11,372 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:53:11,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:53:11,373 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:53:11,374 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:53:11,374 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:53:11,419 INFO ]: Repository-Root is: /tmp [2018-06-25 09:53:11,438 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:53:11,445 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:53:11,446 INFO ]: Initializing SmtParser... [2018-06-25 09:53:11,446 INFO ]: SmtParser initialized [2018-06-25 09:53:11,447 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 [2018-06-25 09:53:11,448 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:53:11,540 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@5a4bc256 [2018-06-25 09:53:11,711 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 [2018-06-25 09:53:11,725 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:53:11,730 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:53:11,731 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:53:11,731 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:53:11,731 INFO ]: ChcToBoogie initialized [2018-06-25 09:53:11,734 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:53:11" (1/1) ... [2018-06-25 09:53:11,791 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:53:11 Unit [2018-06-25 09:53:11,792 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:53:11,793 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:53:11,793 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:53:11,793 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:53:11,813 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:53:11" (1/1) ... [2018-06-25 09:53:11,813 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:53:11" (1/1) ... [2018-06-25 09:53:11,817 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:53:11" (1/1) ... [2018-06-25 09:53:11,818 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:53:11" (1/1) ... [2018-06-25 09:53:11,820 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:53:11" (1/1) ... [2018-06-25 09:53:11,822 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:53:11" (1/1) ... [2018-06-25 09:53:11,823 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:53:11" (1/1) ... [2018-06-25 09:53:11,824 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:53:11,825 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:53:11,825 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:53:11,825 INFO ]: RCFGBuilder initialized [2018-06-25 09:53:11,829 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:53:11" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:53:11,846 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:53:11,846 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:53:11,846 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:53:11,847 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:53:11,847 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:53:11,847 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:53:12,041 INFO ]: Using library mode [2018-06-25 09:53:12,042 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:53:12 BoogieIcfgContainer [2018-06-25 09:53:12,042 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:53:12,043 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:53:12,043 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:53:12,046 INFO ]: TraceAbstraction initialized [2018-06-25 09:53:12,046 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:53:11" (1/3) ... [2018-06-25 09:53:12,047 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5484d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:53:12, skipping insertion in model container [2018-06-25 09:53:12,047 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:53:11" (2/3) ... [2018-06-25 09:53:12,047 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5484d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:53:12, skipping insertion in model container [2018-06-25 09:53:12,047 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:53:12" (3/3) ... [2018-06-25 09:53:12,049 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:53:12,059 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:53:12,068 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:53:12,106 INFO ]: Using default assertion order modulation [2018-06-25 09:53:12,106 INFO ]: Interprodecural is true [2018-06-25 09:53:12,106 INFO ]: Hoare is false [2018-06-25 09:53:12,107 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:53:12,107 INFO ]: Backedges is TWOTRACK [2018-06-25 09:53:12,107 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:53:12,108 INFO ]: Difference is false [2018-06-25 09:53:12,108 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:53:12,108 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:53:12,121 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 09:53:12,137 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:53:12,137 INFO ]: Found error trace [2018-06-25 09:53:12,138 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:12,139 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:12,144 INFO ]: Analyzing trace with hash -204663978, now seen corresponding path program 1 times [2018-06-25 09:53:12,146 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:12,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:12,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:12,186 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:12,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:12,236 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:12,279 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:12,281 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:53:12,281 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:53:12,283 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:53:12,296 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:53:12,297 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:53:12,301 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 09:53:12,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:12,446 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-25 09:53:12,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:53:12,448 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:53:12,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:12,459 INFO ]: With dead ends: 9 [2018-06-25 09:53:12,459 INFO ]: Without dead ends: 9 [2018-06-25 09:53:12,461 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:53:12,474 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:53:12,487 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:53:12,489 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:53:12,489 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-25 09:53:12,491 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-25 09:53:12,491 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:12,491 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-25 09:53:12,491 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:53:12,491 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-25 09:53:12,491 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:53:12,491 INFO ]: Found error trace [2018-06-25 09:53:12,491 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:12,491 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:12,492 INFO ]: Analyzing trace with hash -2053405102, now seen corresponding path program 1 times [2018-06-25 09:53:12,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:12,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:12,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:12,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:12,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:12,508 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:12,724 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:12,724 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:12,724 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:12,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:12,765 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:12,772 INFO ]: Computing forward predicates... [2018-06-25 09:53:12,932 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:12,964 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:53:12,964 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-25 09:53:12,965 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:53:12,965 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:53:12,965 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:53:12,965 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 5 states. [2018-06-25 09:53:13,310 WARN ]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-25 09:53:13,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:13,338 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-25 09:53:13,338 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:53:13,338 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:53:13,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:13,339 INFO ]: With dead ends: 12 [2018-06-25 09:53:13,339 INFO ]: Without dead ends: 12 [2018-06-25 09:53:13,340 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:53:13,340 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:53:13,341 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-25 09:53:13,341 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:53:13,342 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-25 09:53:13,342 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 8 [2018-06-25 09:53:13,342 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:13,342 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-25 09:53:13,342 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:53:13,342 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-25 09:53:13,342 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:53:13,342 INFO ]: Found error trace [2018-06-25 09:53:13,342 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:13,342 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:13,342 INFO ]: Analyzing trace with hash -2048787497, now seen corresponding path program 1 times [2018-06-25 09:53:13,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:13,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:13,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:13,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:13,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:13,352 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:13,395 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:13,395 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:53:13,395 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:53:13,395 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:53:13,396 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:53:13,396 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:53:13,396 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 3 states. [2018-06-25 09:53:13,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:13,424 INFO ]: Finished difference Result 11 states and 18 transitions. [2018-06-25 09:53:13,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:53:13,425 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:53:13,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:13,426 INFO ]: With dead ends: 11 [2018-06-25 09:53:13,426 INFO ]: Without dead ends: 11 [2018-06-25 09:53:13,426 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:53:13,426 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:53:13,428 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:53:13,428 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:53:13,428 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2018-06-25 09:53:13,428 INFO ]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 8 [2018-06-25 09:53:13,428 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:13,428 INFO ]: Abstraction has 11 states and 18 transitions. [2018-06-25 09:53:13,428 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:53:13,428 INFO ]: Start isEmpty. Operand 11 states and 18 transitions. [2018-06-25 09:53:13,429 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:53:13,429 INFO ]: Found error trace [2018-06-25 09:53:13,429 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:13,429 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:13,429 INFO ]: Analyzing trace with hash 761468114, now seen corresponding path program 1 times [2018-06-25 09:53:13,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:13,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:13,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:13,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:13,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:13,452 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:13,558 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:13,558 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:13,558 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:13,564 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:13,592 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:13,594 INFO ]: Computing forward predicates... [2018-06-25 09:53:14,493 WARN ]: Spent 575.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-06-25 09:53:14,506 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:14,526 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:14,526 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 09:53:14,526 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:53:14,527 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:53:14,527 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:53:14,527 INFO ]: Start difference. First operand 11 states and 18 transitions. Second operand 8 states. [2018-06-25 09:53:14,715 WARN ]: Spent 175.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-06-25 09:53:14,759 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:14,759 INFO ]: Finished difference Result 19 states and 40 transitions. [2018-06-25 09:53:14,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:53:14,760 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 09:53:14,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:14,760 INFO ]: With dead ends: 19 [2018-06-25 09:53:14,761 INFO ]: Without dead ends: 19 [2018-06-25 09:53:14,761 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:53:14,761 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:53:14,763 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-25 09:53:14,763 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:53:14,764 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2018-06-25 09:53:14,764 INFO ]: Start accepts. Automaton has 15 states and 28 transitions. Word has length 9 [2018-06-25 09:53:14,764 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:14,764 INFO ]: Abstraction has 15 states and 28 transitions. [2018-06-25 09:53:14,764 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:53:14,764 INFO ]: Start isEmpty. Operand 15 states and 28 transitions. [2018-06-25 09:53:14,764 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:53:14,764 INFO ]: Found error trace [2018-06-25 09:53:14,764 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:14,764 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:14,765 INFO ]: Analyzing trace with hash -1312306230, now seen corresponding path program 2 times [2018-06-25 09:53:14,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:14,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:14,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:14,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:14,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:14,776 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:14,804 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:53:14,804 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:53:14,804 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:53:14,804 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:53:14,804 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:53:14,809 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:53:14,809 INFO ]: Start difference. First operand 15 states and 28 transitions. Second operand 3 states. [2018-06-25 09:53:14,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:14,833 INFO ]: Finished difference Result 15 states and 24 transitions. [2018-06-25 09:53:14,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:53:14,833 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 09:53:14,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:14,833 INFO ]: With dead ends: 15 [2018-06-25 09:53:14,833 INFO ]: Without dead ends: 15 [2018-06-25 09:53:14,834 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:53:14,834 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:53:14,835 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:53:14,835 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:53:14,836 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2018-06-25 09:53:14,836 INFO ]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 10 [2018-06-25 09:53:14,836 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:14,836 INFO ]: Abstraction has 15 states and 24 transitions. [2018-06-25 09:53:14,836 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:53:14,836 INFO ]: Start isEmpty. Operand 15 states and 24 transitions. [2018-06-25 09:53:14,836 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:53:14,836 INFO ]: Found error trace [2018-06-25 09:53:14,836 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:14,836 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:14,836 INFO ]: Analyzing trace with hash -1169160475, now seen corresponding path program 1 times [2018-06-25 09:53:14,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:14,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:14,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:14,837 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:14,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:14,847 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:14,946 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:14,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:14,946 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:14,953 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:14,968 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:14,970 INFO ]: Computing forward predicates... [2018-06-25 09:53:14,995 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:53:15,015 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:53:15,016 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-25 09:53:15,016 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:53:15,016 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:53:15,016 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:53:15,016 INFO ]: Start difference. First operand 15 states and 24 transitions. Second operand 6 states. [2018-06-25 09:53:15,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:15,065 INFO ]: Finished difference Result 17 states and 24 transitions. [2018-06-25 09:53:15,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:53:15,065 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-25 09:53:15,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:15,066 INFO ]: With dead ends: 17 [2018-06-25 09:53:15,066 INFO ]: Without dead ends: 16 [2018-06-25 09:53:15,066 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:53:15,066 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:53:15,068 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 09:53:15,068 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:53:15,068 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-06-25 09:53:15,069 INFO ]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 10 [2018-06-25 09:53:15,069 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:15,069 INFO ]: Abstraction has 16 states and 22 transitions. [2018-06-25 09:53:15,069 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:53:15,069 INFO ]: Start isEmpty. Operand 16 states and 22 transitions. [2018-06-25 09:53:15,069 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:53:15,069 INFO ]: Found error trace [2018-06-25 09:53:15,069 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:15,069 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:15,069 INFO ]: Analyzing trace with hash -2029224297, now seen corresponding path program 2 times [2018-06-25 09:53:15,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:15,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:15,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:15,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:15,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:15,081 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:15,218 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:15,218 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:15,218 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:15,228 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:53:15,242 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:53:15,242 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:15,244 INFO ]: Computing forward predicates... [2018-06-25 09:53:15,696 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:15,724 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:15,724 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-25 09:53:15,725 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:53:15,725 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:53:15,725 INFO ]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:53:15,725 INFO ]: Start difference. First operand 16 states and 22 transitions. Second operand 10 states. [2018-06-25 09:53:15,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:15,812 INFO ]: Finished difference Result 21 states and 29 transitions. [2018-06-25 09:53:15,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:53:15,814 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-25 09:53:15,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:15,814 INFO ]: With dead ends: 21 [2018-06-25 09:53:15,814 INFO ]: Without dead ends: 21 [2018-06-25 09:53:15,815 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:53:15,815 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:53:15,817 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-25 09:53:15,817 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:53:15,817 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-06-25 09:53:15,817 INFO ]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 10 [2018-06-25 09:53:15,817 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:15,817 INFO ]: Abstraction has 19 states and 27 transitions. [2018-06-25 09:53:15,817 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:53:15,817 INFO ]: Start isEmpty. Operand 19 states and 27 transitions. [2018-06-25 09:53:15,818 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:53:15,818 INFO ]: Found error trace [2018-06-25 09:53:15,818 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:15,818 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:15,818 INFO ]: Analyzing trace with hash 1386955986, now seen corresponding path program 3 times [2018-06-25 09:53:15,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:15,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:15,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:15,819 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:15,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:15,830 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:15,943 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:15,943 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:15,943 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:15,951 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:53:15,967 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:53:15,967 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:15,969 INFO ]: Computing forward predicates... [2018-06-25 09:53:16,170 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:16,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:16,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-25 09:53:16,198 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:53:16,198 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:53:16,198 INFO ]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:53:16,198 INFO ]: Start difference. First operand 19 states and 27 transitions. Second operand 12 states. [2018-06-25 09:53:16,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:16,477 INFO ]: Finished difference Result 25 states and 35 transitions. [2018-06-25 09:53:16,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:53:16,477 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-25 09:53:16,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:16,478 INFO ]: With dead ends: 25 [2018-06-25 09:53:16,478 INFO ]: Without dead ends: 25 [2018-06-25 09:53:16,478 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:53:16,478 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:53:16,480 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-25 09:53:16,481 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:53:16,481 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-06-25 09:53:16,481 INFO ]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 11 [2018-06-25 09:53:16,481 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:16,481 INFO ]: Abstraction has 22 states and 32 transitions. [2018-06-25 09:53:16,481 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:53:16,481 INFO ]: Start isEmpty. Operand 22 states and 32 transitions. [2018-06-25 09:53:16,483 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:53:16,483 INFO ]: Found error trace [2018-06-25 09:53:16,483 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:16,483 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:16,483 INFO ]: Analyzing trace with hash -408858281, now seen corresponding path program 3 times [2018-06-25 09:53:16,483 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:16,483 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:16,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:16,484 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:16,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:16,504 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:16,619 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:16,619 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:16,619 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:16,625 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:53:16,639 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:53:16,639 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:16,641 INFO ]: Computing forward predicates... [2018-06-25 09:53:16,846 INFO ]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:16,866 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:16,866 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-25 09:53:16,866 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:53:16,866 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:53:16,866 INFO ]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:53:16,866 INFO ]: Start difference. First operand 22 states and 32 transitions. Second operand 14 states. [2018-06-25 09:53:17,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:17,140 INFO ]: Finished difference Result 34 states and 45 transitions. [2018-06-25 09:53:17,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:53:17,141 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-25 09:53:17,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:17,142 INFO ]: With dead ends: 34 [2018-06-25 09:53:17,142 INFO ]: Without dead ends: 34 [2018-06-25 09:53:17,142 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:53:17,142 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:53:17,145 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-06-25 09:53:17,145 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:53:17,146 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-25 09:53:17,146 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 12 [2018-06-25 09:53:17,146 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:17,146 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-25 09:53:17,146 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:53:17,146 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-25 09:53:17,146 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:53:17,146 INFO ]: Found error trace [2018-06-25 09:53:17,146 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:17,146 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:17,146 INFO ]: Analyzing trace with hash 1185379538, now seen corresponding path program 4 times [2018-06-25 09:53:17,146 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:17,146 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:17,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:17,147 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:17,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:17,158 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:17,267 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:17,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:17,267 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:17,273 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:53:17,288 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:53:17,288 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:17,290 INFO ]: Computing forward predicates... [2018-06-25 09:53:17,516 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:17,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:17,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-25 09:53:17,536 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:53:17,537 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:53:17,537 INFO ]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:53:17,537 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 16 states. [2018-06-25 09:53:17,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:17,769 INFO ]: Finished difference Result 48 states and 62 transitions. [2018-06-25 09:53:17,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:53:17,769 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-25 09:53:17,769 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:17,770 INFO ]: With dead ends: 48 [2018-06-25 09:53:17,770 INFO ]: Without dead ends: 48 [2018-06-25 09:53:17,770 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:53:17,770 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 09:53:17,773 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 23. [2018-06-25 09:53:17,773 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:53:17,773 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-06-25 09:53:17,773 INFO ]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 13 [2018-06-25 09:53:17,773 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:17,773 INFO ]: Abstraction has 23 states and 32 transitions. [2018-06-25 09:53:17,773 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:53:17,774 INFO ]: Start isEmpty. Operand 23 states and 32 transitions. [2018-06-25 09:53:17,774 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:53:17,774 INFO ]: Found error trace [2018-06-25 09:53:17,774 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:17,774 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:17,774 INFO ]: Analyzing trace with hash 1984721943, now seen corresponding path program 4 times [2018-06-25 09:53:17,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:17,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:17,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:17,775 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:17,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:17,799 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:18,107 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:18,107 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:18,107 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:18,114 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:53:18,140 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:53:18,140 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:18,143 INFO ]: Computing forward predicates... [2018-06-25 09:53:18,279 WARN ]: Spent 121.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2018-06-25 09:53:18,733 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:18,752 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:18,752 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-25 09:53:18,752 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:53:18,752 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:53:18,752 INFO ]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:53:18,753 INFO ]: Start difference. First operand 23 states and 32 transitions. Second operand 18 states. [2018-06-25 09:53:18,993 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:18,994 INFO ]: Finished difference Result 57 states and 73 transitions. [2018-06-25 09:53:18,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:53:18,994 INFO ]: Start accepts. Automaton has 18 states. Word has length 14 [2018-06-25 09:53:18,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:18,995 INFO ]: With dead ends: 57 [2018-06-25 09:53:18,995 INFO ]: Without dead ends: 57 [2018-06-25 09:53:18,995 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:53:18,995 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-25 09:53:18,998 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 26. [2018-06-25 09:53:18,998 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:53:18,998 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-06-25 09:53:18,998 INFO ]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2018-06-25 09:53:18,998 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:18,999 INFO ]: Abstraction has 26 states and 37 transitions. [2018-06-25 09:53:18,999 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:53:18,999 INFO ]: Start isEmpty. Operand 26 states and 37 transitions. [2018-06-25 09:53:18,999 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:53:18,999 INFO ]: Found error trace [2018-06-25 09:53:18,999 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:18,999 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:18,999 INFO ]: Analyzing trace with hash 743941330, now seen corresponding path program 5 times [2018-06-25 09:53:18,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:18,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:19,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:19,000 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:19,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:19,012 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:19,261 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:19,262 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:19,262 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:19,268 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:53:19,290 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-25 09:53:19,290 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:19,293 INFO ]: Computing forward predicates... [2018-06-25 09:53:19,452 INFO ]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:19,472 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:19,472 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-25 09:53:19,473 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:53:19,473 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:53:19,473 INFO ]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:53:19,474 INFO ]: Start difference. First operand 26 states and 37 transitions. Second operand 19 states. [2018-06-25 09:53:20,331 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:20,331 INFO ]: Finished difference Result 70 states and 86 transitions. [2018-06-25 09:53:20,331 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-25 09:53:20,332 INFO ]: Start accepts. Automaton has 19 states. Word has length 15 [2018-06-25 09:53:20,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:20,333 INFO ]: With dead ends: 70 [2018-06-25 09:53:20,333 INFO ]: Without dead ends: 70 [2018-06-25 09:53:20,334 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=334, Invalid=1922, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 09:53:20,334 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-25 09:53:20,336 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 21. [2018-06-25 09:53:20,336 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:53:20,337 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-06-25 09:53:20,337 INFO ]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2018-06-25 09:53:20,337 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:20,337 INFO ]: Abstraction has 21 states and 26 transitions. [2018-06-25 09:53:20,337 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:53:20,337 INFO ]: Start isEmpty. Operand 21 states and 26 transitions. [2018-06-25 09:53:20,337 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:53:20,337 INFO ]: Found error trace [2018-06-25 09:53:20,337 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:20,337 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:20,337 INFO ]: Analyzing trace with hash 112846551, now seen corresponding path program 5 times [2018-06-25 09:53:20,337 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:20,337 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:20,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:20,338 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:20,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:20,352 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:20,478 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:20,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:20,478 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:20,484 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:53:20,506 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-25 09:53:20,506 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:20,509 INFO ]: Computing forward predicates... [2018-06-25 09:53:20,728 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:20,752 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:20,752 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-25 09:53:20,752 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:53:20,752 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:53:20,753 INFO ]: CoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:53:20,753 INFO ]: Start difference. First operand 21 states and 26 transitions. Second operand 22 states. [2018-06-25 09:53:20,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:20,833 INFO ]: Finished difference Result 86 states and 106 transitions. [2018-06-25 09:53:20,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:53:20,833 INFO ]: Start accepts. Automaton has 22 states. Word has length 16 [2018-06-25 09:53:20,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:20,834 INFO ]: With dead ends: 86 [2018-06-25 09:53:20,834 INFO ]: Without dead ends: 86 [2018-06-25 09:53:20,835 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:53:20,835 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-25 09:53:20,838 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 24. [2018-06-25 09:53:20,838 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:53:20,838 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-06-25 09:53:20,838 INFO ]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2018-06-25 09:53:20,838 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:20,838 INFO ]: Abstraction has 24 states and 31 transitions. [2018-06-25 09:53:20,838 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:53:20,838 INFO ]: Start isEmpty. Operand 24 states and 31 transitions. [2018-06-25 09:53:20,839 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:53:20,839 INFO ]: Found error trace [2018-06-25 09:53:20,839 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:20,839 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:20,839 INFO ]: Analyzing trace with hash 1723585746, now seen corresponding path program 6 times [2018-06-25 09:53:20,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:20,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:20,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:20,840 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:20,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:20,851 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:21,015 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:21,016 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:21,016 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:21,021 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:53:21,108 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-25 09:53:21,108 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:21,110 INFO ]: Computing forward predicates... [2018-06-25 09:53:21,528 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:21,549 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:21,549 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-25 09:53:21,549 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:53:21,549 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:53:21,550 INFO ]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:53:21,550 INFO ]: Start difference. First operand 24 states and 31 transitions. Second operand 24 states. [2018-06-25 09:53:22,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:22,277 INFO ]: Finished difference Result 96 states and 117 transitions. [2018-06-25 09:53:22,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 09:53:22,277 INFO ]: Start accepts. Automaton has 24 states. Word has length 17 [2018-06-25 09:53:22,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:22,278 INFO ]: With dead ends: 96 [2018-06-25 09:53:22,278 INFO ]: Without dead ends: 96 [2018-06-25 09:53:22,279 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=312, Invalid=1494, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 09:53:22,279 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-25 09:53:22,284 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 25. [2018-06-25 09:53:22,284 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:53:22,287 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-06-25 09:53:22,287 INFO ]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2018-06-25 09:53:22,287 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:22,287 INFO ]: Abstraction has 25 states and 33 transitions. [2018-06-25 09:53:22,287 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:53:22,287 INFO ]: Start isEmpty. Operand 25 states and 33 transitions. [2018-06-25 09:53:22,288 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:53:22,288 INFO ]: Found error trace [2018-06-25 09:53:22,288 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:22,288 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:22,288 INFO ]: Analyzing trace with hash 1884067410, now seen corresponding path program 7 times [2018-06-25 09:53:22,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:22,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:22,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:22,288 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:53:22,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:22,315 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:22,531 INFO ]: Checked inductivity of 66 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:22,531 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:22,531 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:22,537 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:22,558 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:22,562 INFO ]: Computing forward predicates... [2018-06-25 09:53:22,737 INFO ]: Checked inductivity of 66 backedges. 1 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:22,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:53:22,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-25 09:53:22,756 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:53:22,757 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:53:22,757 INFO ]: CoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:53:22,757 INFO ]: Start difference. First operand 25 states and 33 transitions. Second operand 25 states. [2018-06-25 09:53:23,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:23,104 INFO ]: Finished difference Result 81 states and 89 transitions. [2018-06-25 09:53:23,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:53:23,105 INFO ]: Start accepts. Automaton has 25 states. Word has length 18 [2018-06-25 09:53:23,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:23,105 INFO ]: With dead ends: 81 [2018-06-25 09:53:23,105 INFO ]: Without dead ends: 81 [2018-06-25 09:53:23,106 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:53:23,106 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-25 09:53:23,108 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 32. [2018-06-25 09:53:23,108 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:53:23,109 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-25 09:53:23,109 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2018-06-25 09:53:23,115 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:23,115 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-25 09:53:23,115 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:53:23,115 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-25 09:53:23,116 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:53:23,116 INFO ]: Found error trace [2018-06-25 09:53:23,116 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:53:23,116 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:53:23,116 INFO ]: Analyzing trace with hash 11360813, now seen corresponding path program 6 times [2018-06-25 09:53:23,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:53:23,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:53:23,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:23,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:53:23,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:53:23,132 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:23,555 INFO ]: Checked inductivity of 78 backedges. 67 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:23,555 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:53:23,555 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-25 09:53:23,561 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:53:23,679 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 09:53:23,679 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:53:23,681 INFO ]: Computing forward predicates... [2018-06-25 09:53:23,759 INFO ]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:53:23,785 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:53:23,785 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 15 [2018-06-25 09:53:23,785 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:53:23,785 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:53:23,785 INFO ]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:53:23,785 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 15 states. [2018-06-25 09:53:23,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:53:23,845 INFO ]: Finished difference Result 94 states and 108 transitions. [2018-06-25 09:53:23,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:53:23,845 INFO ]: Start accepts. Automaton has 15 states. Word has length 19 [2018-06-25 09:53:23,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:53:23,845 INFO ]: With dead ends: 94 [2018-06-25 09:53:23,845 INFO ]: Without dead ends: 0 [2018-06-25 09:53:23,845 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:53:23,846 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:53:23,846 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:53:23,846 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:53:23,846 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:53:23,846 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-06-25 09:53:23,846 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:53:23,846 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:53:23,846 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:53:23,846 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:53:23,846 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:53:23,850 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:53:23 BoogieIcfgContainer [2018-06-25 09:53:23,850 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:53:23,850 INFO ]: Toolchain (without parser) took 12125.04 ms. Allocated memory was 303.0 MB in the beginning and 455.6 MB in the end (delta: 152.6 MB). Free memory was 259.4 MB in the beginning and 386.5 MB in the end (delta: -127.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:23,851 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:53:23,851 INFO ]: ChcToBoogie took 61.55 ms. Allocated memory is still 303.0 MB. Free memory was 259.4 MB in the beginning and 257.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:23,852 INFO ]: Boogie Preprocessor took 31.26 ms. Allocated memory is still 303.0 MB. Free memory was 257.4 MB in the beginning and 256.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:23,852 INFO ]: RCFGBuilder took 217.42 ms. Allocated memory is still 303.0 MB. Free memory was 256.4 MB in the beginning and 248.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:23,853 INFO ]: TraceAbstraction took 11806.77 ms. Allocated memory was 303.0 MB in the beginning and 455.6 MB in the end (delta: 152.6 MB). Free memory was 248.4 MB in the beginning and 386.5 MB in the end (delta: -138.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:23,855 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.55 ms. Allocated memory is still 303.0 MB. Free memory was 259.4 MB in the beginning and 257.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 31.26 ms. Allocated memory is still 303.0 MB. Free memory was 257.4 MB in the beginning and 256.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 217.42 ms. Allocated memory is still 303.0 MB. Free memory was 256.4 MB in the beginning and 248.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 11806.77 ms. Allocated memory was 303.0 MB in the beginning and 455.6 MB in the end (delta: 152.6 MB). Free memory was 248.4 MB in the beginning and 386.5 MB in the end (delta: -138.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. SAFE Result, 11.7s OverallTime, 16 OverallIterations, 11 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 4 SDslu, 528 SDs, 0 SdLazy, 1326 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 312 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 37131 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1725 ConjunctsInSsa, 774 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 183/747 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break_single.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-53-23-867.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break_single.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-53-23-867.csv Received shutdown request...